/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:10:00,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:10:00,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:10:00,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:10:00,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:10:00,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:10:00,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:10:00,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:10:00,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:10:00,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:10:00,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:10:00,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:10:00,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:10:00,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:10:00,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:10:00,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:10:00,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:10:00,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:10:00,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:10:00,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:10:00,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:10:00,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:10:00,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:10:00,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:10:00,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:10:00,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:10:00,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:10:00,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:10:00,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:10:00,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:10:00,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:10:00,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:10:00,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:10:00,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:10:00,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:10:00,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:10:00,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:10:00,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:10:00,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:10:00,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:10:00,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:10:00,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 02:10:00,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:10:00,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:10:00,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:10:00,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:10:00,753 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:10:00,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:10:00,754 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:10:00,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:10:00,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:10:00,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:10:00,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:10:00,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:10:00,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:10:00,755 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:10:00,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:10:00,755 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:10:00,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:10:00,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:10:00,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:10:00,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:10:00,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:10:00,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:10:00,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:10:00,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:10:00,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:10:00,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:10:00,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:10:00,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:10:00,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-13 02:10:01,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:10:01,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:10:01,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:10:01,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:10:01,098 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:10:01,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2022-12-13 02:10:02,262 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:10:02,480 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:10:02,480 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2022-12-13 02:10:02,486 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fadc6efe1/c3091508e7ab4d00861ad2776d8ccd0a/FLAGef9fcedac [2022-12-13 02:10:02,497 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fadc6efe1/c3091508e7ab4d00861ad2776d8ccd0a [2022-12-13 02:10:02,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:10:02,500 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:10:02,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:10:02,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:10:02,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:10:02,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a786a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02, skipping insertion in model container [2022-12-13 02:10:02,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:10:02,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:10:02,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,681 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c[3615,3628] [2022-12-13 02:10:02,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:10:02,709 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:10:02,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:10:02,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:10:02,754 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c[3615,3628] [2022-12-13 02:10:02,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:10:02,780 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:10:02,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02 WrapperNode [2022-12-13 02:10:02,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:10:02,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:10:02,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:10:02,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:10:02,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,847 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 257 [2022-12-13 02:10:02,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:10:02,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:10:02,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:10:02,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:10:02,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,872 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:10:02,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:10:02,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:10:02,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:10:02,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (1/1) ... [2022-12-13 02:10:02,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:10:02,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:10:02,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 02:10:02,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 02:10:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:10:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:10:02,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:10:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:10:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 02:10:02,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 02:10:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 02:10:02,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 02:10:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 02:10:02,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 02:10:02,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:10:02,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 02:10:02,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 02:10:02,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 02:10:02,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:10:02,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:10:02,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:10:02,962 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 02:10:03,110 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:10:03,124 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:10:03,512 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:10:03,598 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:10:03,599 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 02:10:03,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:10:03 BoogieIcfgContainer [2022-12-13 02:10:03,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:10:03,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:10:03,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:10:03,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:10:03,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:10:02" (1/3) ... [2022-12-13 02:10:03,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e14aed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:10:03, skipping insertion in model container [2022-12-13 02:10:03,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:02" (2/3) ... [2022-12-13 02:10:03,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e14aed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:10:03, skipping insertion in model container [2022-12-13 02:10:03,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:10:03" (3/3) ... [2022-12-13 02:10:03,609 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2022-12-13 02:10:03,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:10:03,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 02:10:03,625 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:10:03,699 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 02:10:03,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 206 transitions, 436 flow [2022-12-13 02:10:03,795 INFO L130 PetriNetUnfolder]: 18/203 cut-off events. [2022-12-13 02:10:03,795 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:10:03,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 18/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 122 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 165. Up to 3 conditions per place. [2022-12-13 02:10:03,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 206 transitions, 436 flow [2022-12-13 02:10:03,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 193 transitions, 404 flow [2022-12-13 02:10:03,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:03,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 193 transitions, 404 flow [2022-12-13 02:10:03,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 193 transitions, 404 flow [2022-12-13 02:10:03,872 INFO L130 PetriNetUnfolder]: 18/193 cut-off events. [2022-12-13 02:10:03,872 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:10:03,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 193 events. 18/193 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 121 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 165. Up to 3 conditions per place. [2022-12-13 02:10:03,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 193 transitions, 404 flow [2022-12-13 02:10:03,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 1880 [2022-12-13 02:10:11,905 INFO L241 LiptonReduction]: Total number of compositions: 164 [2022-12-13 02:10:11,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:10:11,925 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3822147c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:10:11,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 02:10:11,932 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-13 02:10:11,932 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:10:11,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:11,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:11,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1670425582, now seen corresponding path program 1 times [2022-12-13 02:10:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:11,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866083559] [2022-12-13 02:10:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:12,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:12,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866083559] [2022-12-13 02:10:12,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866083559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:12,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:12,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:10:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367843465] [2022-12-13 02:10:12,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:12,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 02:10:12,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:12,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 02:10:12,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 02:10:12,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 02:10:12,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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) [2022-12-13 02:10:12,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:12,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 02:10:12,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:12,378 INFO L130 PetriNetUnfolder]: 323/460 cut-off events. [2022-12-13 02:10:12,379 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 02:10:12,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 460 events. 323/460 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1315 event pairs, 190 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 765. Up to 460 conditions per place. [2022-12-13 02:10:12,388 INFO L137 encePairwiseOnDemand]: 27/28 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-12-13 02:10:12,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 124 flow [2022-12-13 02:10:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 02:10:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 02:10:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2022-12-13 02:10:12,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-13 02:10:12,400 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 2 states and 29 transitions. [2022-12-13 02:10:12,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 124 flow [2022-12-13 02:10:12,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 02:10:12,406 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 60 flow [2022-12-13 02:10:12,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2022-12-13 02:10:12,414 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2022-12-13 02:10:12,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:12,415 INFO L89 Accepts]: Start accepts. Operand has 27 places, 27 transitions, 60 flow [2022-12-13 02:10:12,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:12,418 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:12,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 27 transitions, 60 flow [2022-12-13 02:10:12,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 27 transitions, 60 flow [2022-12-13 02:10:12,425 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-13 02:10:12,426 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:10:12,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 27 events. 5/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2022-12-13 02:10:12,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 27 transitions, 60 flow [2022-12-13 02:10:12,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 02:10:12,566 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:10:12,569 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 02:10:12,569 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 27 transitions, 60 flow [2022-12-13 02:10:12,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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) [2022-12-13 02:10:12,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:12,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:12,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:10:12,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash 704626681, now seen corresponding path program 1 times [2022-12-13 02:10:12,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:12,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278418469] [2022-12-13 02:10:12,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:12,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:12,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278418469] [2022-12-13 02:10:12,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278418469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:12,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:12,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:10:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178268409] [2022-12-13 02:10:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:12,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:10:12,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:12,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:10:12,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:10:12,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-13 02:10:12,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-12-13 02:10:12,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:12,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-13 02:10:12,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:13,003 INFO L130 PetriNetUnfolder]: 328/479 cut-off events. [2022-12-13 02:10:13,004 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 02:10:13,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 479 events. 328/479 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1428 event pairs, 192 based on Foata normal form. 18/360 useless extension candidates. Maximal degree in co-relation 161. Up to 460 conditions per place. [2022-12-13 02:10:13,006 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 25 selfloop transitions, 2 changer transitions 12/40 dead transitions. [2022-12-13 02:10:13,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 167 flow [2022-12-13 02:10:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:10:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:10:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-13 02:10:13,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-12-13 02:10:13,008 INFO L175 Difference]: Start difference. First operand has 26 places, 27 transitions, 60 flow. Second operand 4 states and 46 transitions. [2022-12-13 02:10:13,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 167 flow [2022-12-13 02:10:13,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 02:10:13,010 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 78 flow [2022-12-13 02:10:13,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2022-12-13 02:10:13,011 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2022-12-13 02:10:13,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:13,011 INFO L89 Accepts]: Start accepts. Operand has 31 places, 28 transitions, 78 flow [2022-12-13 02:10:13,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:13,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:13,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 28 transitions, 78 flow [2022-12-13 02:10:13,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 78 flow [2022-12-13 02:10:13,018 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-13 02:10:13,018 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:10:13,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 35 events. 8/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 46. Up to 9 conditions per place. [2022-12-13 02:10:13,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 78 flow [2022-12-13 02:10:13,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 02:10:14,366 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:10:14,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1356 [2022-12-13 02:10:14,368 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 74 flow [2022-12-13 02:10:14,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-12-13 02:10:14,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:14,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:14,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:10:14,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:14,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1044683586, now seen corresponding path program 1 times [2022-12-13 02:10:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:14,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667588522] [2022-12-13 02:10:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:14,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:14,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667588522] [2022-12-13 02:10:14,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667588522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:14,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:14,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:10:14,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982741252] [2022-12-13 02:10:14,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:14,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:10:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:14,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:10:14,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:10:14,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-13 02:10:14,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-12-13 02:10:14,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:14,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-13 02:10:14,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:14,622 INFO L130 PetriNetUnfolder]: 404/593 cut-off events. [2022-12-13 02:10:14,622 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-13 02:10:14,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 593 events. 404/593 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2008 event pairs, 244 based on Foata normal form. 38/470 useless extension candidates. Maximal degree in co-relation 1450. Up to 460 conditions per place. [2022-12-13 02:10:14,626 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 25 selfloop transitions, 2 changer transitions 13/41 dead transitions. [2022-12-13 02:10:14,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 192 flow [2022-12-13 02:10:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:10:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:10:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 02:10:14,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 02:10:14,627 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 74 flow. Second operand 4 states and 48 transitions. [2022-12-13 02:10:14,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 192 flow [2022-12-13 02:10:14,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 184 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 02:10:14,629 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 86 flow [2022-12-13 02:10:14,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-13 02:10:14,630 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2022-12-13 02:10:14,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:14,630 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 86 flow [2022-12-13 02:10:14,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:14,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:14,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 86 flow [2022-12-13 02:10:14,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 86 flow [2022-12-13 02:10:14,637 INFO L130 PetriNetUnfolder]: 16/50 cut-off events. [2022-12-13 02:10:14,638 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:10:14,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 50 events. 16/50 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 event pairs, 3 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 75. Up to 17 conditions per place. [2022-12-13 02:10:14,638 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 28 transitions, 86 flow [2022-12-13 02:10:14,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-13 02:10:14,916 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:10:14,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 287 [2022-12-13 02:10:14,917 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 82 flow [2022-12-13 02:10:14,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-12-13 02:10:14,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:14,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:14,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:10:14,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2023811035, now seen corresponding path program 1 times [2022-12-13 02:10:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:14,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273521645] [2022-12-13 02:10:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:15,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:15,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273521645] [2022-12-13 02:10:15,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273521645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:15,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:15,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:10:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914225108] [2022-12-13 02:10:15,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:15,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:10:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:15,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:10:15,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:10:15,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 02:10:15,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 82 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2022-12-13 02:10:15,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:15,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 02:10:15,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:16,349 INFO L130 PetriNetUnfolder]: 536/780 cut-off events. [2022-12-13 02:10:16,349 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-13 02:10:16,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 780 events. 536/780 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2614 event pairs, 7 based on Foata normal form. 1/584 useless extension candidates. Maximal degree in co-relation 2022. Up to 554 conditions per place. [2022-12-13 02:10:16,354 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 66 selfloop transitions, 28 changer transitions 3/97 dead transitions. [2022-12-13 02:10:16,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 97 transitions, 485 flow [2022-12-13 02:10:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:10:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:10:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-12-13 02:10:16,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40329218106995884 [2022-12-13 02:10:16,357 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 82 flow. Second operand 9 states and 98 transitions. [2022-12-13 02:10:16,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 97 transitions, 485 flow [2022-12-13 02:10:16,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 97 transitions, 477 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 02:10:16,361 INFO L231 Difference]: Finished difference. Result has 40 places, 53 transitions, 271 flow [2022-12-13 02:10:16,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=40, PETRI_TRANSITIONS=53} [2022-12-13 02:10:16,363 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2022-12-13 02:10:16,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:16,363 INFO L89 Accepts]: Start accepts. Operand has 40 places, 53 transitions, 271 flow [2022-12-13 02:10:16,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:16,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:16,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 53 transitions, 271 flow [2022-12-13 02:10:16,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 53 transitions, 271 flow [2022-12-13 02:10:16,382 INFO L130 PetriNetUnfolder]: 85/163 cut-off events. [2022-12-13 02:10:16,382 INFO L131 PetriNetUnfolder]: For 34/82 co-relation queries the response was YES. [2022-12-13 02:10:16,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 163 events. 85/163 cut-off events. For 34/82 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 521 event pairs, 3 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 417. Up to 95 conditions per place. [2022-12-13 02:10:16,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 53 transitions, 271 flow [2022-12-13 02:10:16,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 02:10:16,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-13 02:10:16,654 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-13 02:10:16,999 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-13 02:10:17,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-13 02:10:17,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-13 02:10:17,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:10:17,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-13 02:10:18,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] and [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:10:18,205 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:10:18,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1843 [2022-12-13 02:10:18,206 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 51 transitions, 294 flow [2022-12-13 02:10:18,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2022-12-13 02:10:18,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:18,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:18,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 02:10:18,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:18,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash -640341962, now seen corresponding path program 1 times [2022-12-13 02:10:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:18,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079937927] [2022-12-13 02:10:18,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:18,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:18,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079937927] [2022-12-13 02:10:18,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079937927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:18,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:18,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:10:18,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887270276] [2022-12-13 02:10:18,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:18,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:10:18,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:10:18,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:10:18,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 02:10:18,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 51 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2022-12-13 02:10:18,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:18,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 02:10:18,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:18,508 INFO L130 PetriNetUnfolder]: 385/561 cut-off events. [2022-12-13 02:10:18,509 INFO L131 PetriNetUnfolder]: For 467/474 co-relation queries the response was YES. [2022-12-13 02:10:18,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 561 events. 385/561 cut-off events. For 467/474 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1719 event pairs, 73 based on Foata normal form. 21/429 useless extension candidates. Maximal degree in co-relation 1940. Up to 523 conditions per place. [2022-12-13 02:10:18,513 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 50 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2022-12-13 02:10:18,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 408 flow [2022-12-13 02:10:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:10:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:10:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-13 02:10:18,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2022-12-13 02:10:18,516 INFO L175 Difference]: Start difference. First operand has 38 places, 51 transitions, 294 flow. Second operand 3 states and 49 transitions. [2022-12-13 02:10:18,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 408 flow [2022-12-13 02:10:18,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 57 transitions, 342 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-12-13 02:10:18,521 INFO L231 Difference]: Finished difference. Result has 38 places, 49 transitions, 229 flow [2022-12-13 02:10:18,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=38, PETRI_TRANSITIONS=49} [2022-12-13 02:10:18,523 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-12-13 02:10:18,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:18,523 INFO L89 Accepts]: Start accepts. Operand has 38 places, 49 transitions, 229 flow [2022-12-13 02:10:18,524 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:18,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:18,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 49 transitions, 229 flow [2022-12-13 02:10:18,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 49 transitions, 229 flow [2022-12-13 02:10:18,540 INFO L130 PetriNetUnfolder]: 57/120 cut-off events. [2022-12-13 02:10:18,541 INFO L131 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-12-13 02:10:18,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 120 events. 57/120 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 357 event pairs, 5 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 226. Up to 62 conditions per place. [2022-12-13 02:10:18,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 49 transitions, 229 flow [2022-12-13 02:10:18,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-13 02:10:18,544 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:18,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 02:10:18,546 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 49 transitions, 229 flow [2022-12-13 02:10:18,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2022-12-13 02:10:18,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:18,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:18,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 02:10:18,547 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash -405527460, now seen corresponding path program 2 times [2022-12-13 02:10:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:18,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271288166] [2022-12-13 02:10:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:19,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271288166] [2022-12-13 02:10:19,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271288166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:19,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:19,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:10:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051491514] [2022-12-13 02:10:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:19,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:10:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:19,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:10:19,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:10:19,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 02:10:19,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 49 transitions, 229 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-12-13 02:10:19,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:19,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 02:10:19,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:19,604 INFO L130 PetriNetUnfolder]: 457/670 cut-off events. [2022-12-13 02:10:19,604 INFO L131 PetriNetUnfolder]: For 431/438 co-relation queries the response was YES. [2022-12-13 02:10:19,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 670 events. 457/670 cut-off events. For 431/438 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2120 event pairs, 82 based on Foata normal form. 8/487 useless extension candidates. Maximal degree in co-relation 1636. Up to 587 conditions per place. [2022-12-13 02:10:19,609 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 59 selfloop transitions, 21 changer transitions 3/85 dead transitions. [2022-12-13 02:10:19,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 85 transitions, 519 flow [2022-12-13 02:10:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:10:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:10:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-13 02:10:19,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2847222222222222 [2022-12-13 02:10:19,611 INFO L175 Difference]: Start difference. First operand has 38 places, 49 transitions, 229 flow. Second operand 8 states and 82 transitions. [2022-12-13 02:10:19,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 85 transitions, 519 flow [2022-12-13 02:10:19,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 85 transitions, 496 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 02:10:19,614 INFO L231 Difference]: Finished difference. Result has 47 places, 62 transitions, 358 flow [2022-12-13 02:10:19,615 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=358, PETRI_PLACES=47, PETRI_TRANSITIONS=62} [2022-12-13 02:10:19,617 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2022-12-13 02:10:19,617 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:19,617 INFO L89 Accepts]: Start accepts. Operand has 47 places, 62 transitions, 358 flow [2022-12-13 02:10:19,619 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:19,619 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:19,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 62 transitions, 358 flow [2022-12-13 02:10:19,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 62 transitions, 358 flow [2022-12-13 02:10:19,634 INFO L130 PetriNetUnfolder]: 61/134 cut-off events. [2022-12-13 02:10:19,634 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 02:10:19,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 134 events. 61/134 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 440 event pairs, 3 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 332. Up to 67 conditions per place. [2022-12-13 02:10:19,636 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 62 transitions, 358 flow [2022-12-13 02:10:19,637 INFO L226 LiptonReduction]: Number of co-enabled transitions 386 [2022-12-13 02:10:19,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [933] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (not (= (ite (and (<= 0 v_~q1_back~0_203) (< v_~q1_back~0_203 v_~n1~0_123)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_53| v_~N~0_97)) (= |v_thread1Thread1of1ForFork1_~i~0#1_53| 0) (= (+ v_~q1_back~0_203 1) v_~q1_back~0_202) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (= (select (select |v_#memory_int_291| v_~q1~0.base_120) (+ (* v_~q1_back~0_203 4) v_~q1~0.offset_120)) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= (+ v_~x~0_106 v_~C~0_137) v_~x~0_105) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|)) InVars {~q1~0.offset=v_~q1~0.offset_120, ~C~0=v_~C~0_137, ~q1_back~0=v_~q1_back~0_203, ~n1~0=v_~n1~0_123, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, ~N~0=v_~N~0_97, ~x~0=v_~x~0_106} OutVars{~q1~0.offset=v_~q1~0.offset_120, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_19|, ~C~0=v_~C~0_137, ~n1~0=v_~n1~0_123, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_19|, ~N~0=v_~N~0_97, ~q1_back~0=v_~q1_back~0_202, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_53|, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~x~0=v_~x~0_105, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:10:19,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [933] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (not (= (ite (and (<= 0 v_~q1_back~0_203) (< v_~q1_back~0_203 v_~n1~0_123)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_53| v_~N~0_97)) (= |v_thread1Thread1of1ForFork1_~i~0#1_53| 0) (= (+ v_~q1_back~0_203 1) v_~q1_back~0_202) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (= (select (select |v_#memory_int_291| v_~q1~0.base_120) (+ (* v_~q1_back~0_203 4) v_~q1~0.offset_120)) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= (+ v_~x~0_106 v_~C~0_137) v_~x~0_105) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|)) InVars {~q1~0.offset=v_~q1~0.offset_120, ~C~0=v_~C~0_137, ~q1_back~0=v_~q1_back~0_203, ~n1~0=v_~n1~0_123, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, ~N~0=v_~N~0_97, ~x~0=v_~x~0_106} OutVars{~q1~0.offset=v_~q1~0.offset_120, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_19|, ~C~0=v_~C~0_137, ~n1~0=v_~n1~0_123, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_19|, ~N~0=v_~N~0_97, ~q1_back~0=v_~q1_back~0_202, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_53|, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~x~0=v_~x~0_105, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:10:20,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [934] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_55| 0) (= v_~z~0_127 (+ v_~z~0_128 v_~C~0_139)) (= v_~t~0_138 (+ v_~t~0_139 |v_thread3Thread1of1ForFork0_~k~0#1_77|)) (= |v_thread3Thread1of1ForFork0_#res#1.base_35| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_35| 0) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_77| 0) (= (+ v_~q2_front~0_169 1) v_~q2_front~0_168) (= (select (select |v_#memory_int_293| v_~q2~0.base_131) (+ v_~q2~0.offset_131 (* v_~q2_front~0_169 4))) |v_thread3Thread1of1ForFork0_~k~0#1_77|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| (ite (and (< v_~q2_front~0_169 v_~q2_back~0_206) (< v_~q2_front~0_169 v_~n2~0_158) (<= 0 v_~q2_front~0_169)) 1 0))) InVars {~n2~0=v_~n2~0_158, ~C~0=v_~C~0_139, ~q2~0.offset=v_~q2~0.offset_131, #memory_int=|v_#memory_int_293|, ~q2_front~0=v_~q2_front~0_169, ~q2~0.base=v_~q2~0.base_131, ~z~0=v_~z~0_128, ~q2_back~0=v_~q2_back~0_206, ~t~0=v_~t~0_139} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_49|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ~n2~0=v_~n2~0_158, ~C~0=v_~C~0_139, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, ~q2~0.offset=v_~q2~0.offset_131, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_35|, ~q2_front~0=v_~q2_front~0_168, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_35|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_55|, #memory_int=|v_#memory_int_293|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_49|, ~q2~0.base=v_~q2~0.base_131, ~z~0=v_~z~0_127, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_77|, ~q2_back~0=v_~q2_back~0_206, ~t~0=v_~t~0_138} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:10:20,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [930] $Ultimate##0-->L94-2: Formula: (and (= v_~t~0_134 (+ v_~t~0_135 |v_thread3Thread1of1ForFork0_~k~0#1_75|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47| (ite (and (<= 0 v_~q2_front~0_165) (< v_~q2_front~0_165 v_~n2~0_154) (< v_~q2_front~0_165 v_~q2_back~0_200)) 1 0)) (= v_~q2_front~0_164 (+ v_~q2_front~0_165 1)) (= (+ v_~z~0_124 v_~C~0_131) v_~z~0_123) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_75| 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_75| (select (select |v_#memory_int_285| v_~q2~0.base_127) (+ v_~q2~0.offset_127 (* v_~q2_front~0_165 4)))) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_45| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_47|)) InVars {~n2~0=v_~n2~0_154, ~C~0=v_~C~0_131, ~q2~0.offset=v_~q2~0.offset_127, #memory_int=|v_#memory_int_285|, ~q2_front~0=v_~q2_front~0_165, ~q2~0.base=v_~q2~0.base_127, ~z~0=v_~z~0_124, ~q2_back~0=v_~q2_back~0_200, ~t~0=v_~t~0_135} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_47|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47|, ~n2~0=v_~n2~0_154, ~C~0=v_~C~0_131, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_47|, ~q2~0.offset=v_~q2~0.offset_127, ~q2_front~0=v_~q2_front~0_164, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_45|, #memory_int=|v_#memory_int_285|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_47|, ~q2~0.base=v_~q2~0.base_127, ~z~0=v_~z~0_123, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_75|, ~q2_back~0=v_~q2_back~0_200, ~t~0=v_~t~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:10:20,365 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [933] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_19| 0) (not (= (ite (and (<= 0 v_~q1_back~0_203) (< v_~q1_back~0_203 v_~n1~0_123)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_53| v_~N~0_97)) (= |v_thread1Thread1of1ForFork1_~i~0#1_53| 0) (= (+ v_~q1_back~0_203 1) v_~q1_back~0_202) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| (ite (= (select (select |v_#memory_int_291| v_~q1~0.base_120) (+ (* v_~q1_back~0_203 4) v_~q1~0.offset_120)) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_19| 0) (= (+ v_~x~0_106 v_~C~0_137) v_~x~0_105) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|)) InVars {~q1~0.offset=v_~q1~0.offset_120, ~C~0=v_~C~0_137, ~q1_back~0=v_~q1_back~0_203, ~n1~0=v_~n1~0_123, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, ~N~0=v_~N~0_97, ~x~0=v_~x~0_106} OutVars{~q1~0.offset=v_~q1~0.offset_120, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_19|, ~C~0=v_~C~0_137, ~n1~0=v_~n1~0_123, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_19|, ~N~0=v_~N~0_97, ~q1_back~0=v_~q1_back~0_202, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_53|, ~q1~0.base=v_~q1~0.base_120, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_19|, ~x~0=v_~x~0_105, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 02:10:20,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [931] $Ultimate##0-->L49-5: Formula: (and (not (= (ite (and (< v_~q1_back~0_199 v_~n1~0_121) (<= 0 v_~q1_back~0_199)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_287| v_~q1~0.base_118) (+ (* v_~q1_back~0_199 4) v_~q1~0.offset_118)) 1) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (= |v_thread1Thread1of1ForFork1_~i~0#1_47| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|) (= (+ v_~q1_back~0_199 1) v_~q1_back~0_198) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_47| (+ 1 v_~N~0_95)) (= (+ v_~x~0_102 v_~C~0_133) v_~x~0_101)) InVars {~q1~0.offset=v_~q1~0.offset_118, ~C~0=v_~C~0_133, ~q1_back~0=v_~q1_back~0_199, ~n1~0=v_~n1~0_121, ~q1~0.base=v_~q1~0.base_118, #memory_int=|v_#memory_int_287|, ~N~0=v_~N~0_95, ~x~0=v_~x~0_102} OutVars{~q1~0.offset=v_~q1~0.offset_118, ~C~0=v_~C~0_133, ~n1~0=v_~n1~0_121, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_23|, ~N~0=v_~N~0_95, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_25|, ~q1_back~0=v_~q1_back~0_198, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_23|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~q1~0.base=v_~q1~0.base_118, #memory_int=|v_#memory_int_287|, ~x~0=v_~x~0_101, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 02:10:20,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [935] $Ultimate##0-->L94-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_21| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|) (= v_~t~0_142 (+ v_~t~0_143 |v_thread3Thread1of1ForFork0_~k~0#1_79|)) (= (+ v_~x~0_110 v_~C~0_141) v_~x~0_109) (= (+ v_~q1_back~0_207 1) v_~q1_back~0_206) (= (select (select |v_#memory_int_295| v_~q2~0.base_133) (+ v_~q2~0.offset_133 (* v_~q2_front~0_173 4))) |v_thread3Thread1of1ForFork0_~k~0#1_79|) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_57| v_~N~0_99)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| (ite (= (select (select |v_#memory_int_295| v_~q1~0.base_122) (+ (* v_~q1_back~0_207 4) v_~q1~0.offset_122)) 0) 1 0)) (= (+ v_~q2_front~0_173 1) v_~q2_front~0_172) (= (+ v_~z~0_132 v_~C~0_141) v_~z~0_131) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_79| 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_57| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_21| 0) (not (= (ite (and (<= 0 v_~q1_back~0_207) (< v_~q1_back~0_207 v_~n1~0_125)) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51| (ite (and (<= 0 v_~q2_front~0_173) (< v_~q2_front~0_173 v_~n2~0_160) (< v_~q2_front~0_173 v_~q2_back~0_208)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0))) InVars {~q1~0.offset=v_~q1~0.offset_122, ~n2~0=v_~n2~0_160, ~C~0=v_~C~0_141, ~q2~0.offset=v_~q2~0.offset_133, ~n1~0=v_~n1~0_125, ~q2_front~0=v_~q2_front~0_173, ~N~0=v_~N~0_99, ~q1_back~0=v_~q1_back~0_207, ~q1~0.base=v_~q1~0.base_122, #memory_int=|v_#memory_int_295|, ~q2~0.base=v_~q2~0.base_133, ~z~0=v_~z~0_132, ~x~0=v_~x~0_110, ~q2_back~0=v_~q2_back~0_208, ~t~0=v_~t~0_143} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_51|, ~q2~0.offset=v_~q2~0.offset_133, ~n1~0=v_~n1~0_125, ~q1_back~0=v_~q1_back~0_206, ~q1~0.base=v_~q1~0.base_122, ~q2~0.base=v_~q2~0.base_133, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_21|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_21|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_79|, ~q2_back~0=v_~q2_back~0_208, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1~0.offset=v_~q1~0.offset_122, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_21|, ~n2~0=v_~n2~0_160, ~C~0=v_~C~0_141, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_21|, ~q2_front~0=v_~q2_front~0_172, ~N~0=v_~N~0_99, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_57|, #memory_int=|v_#memory_int_295|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_51|, ~z~0=v_~z~0_131, ~x~0=v_~x~0_109, ~t~0=v_~t~0_142} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post5#1, ~q2_front~0, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread3Thread1of1ForFork0_#t~post11#1, thread1Thread1of1ForFork1_#res#1.offset, ~z~0, thread1Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork0_~k~0#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~t~0] [2022-12-13 02:10:20,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L94-2: Formula: (= v_~t~0_16 0) InVars {} OutVars{thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_21|, ~t~0=v_~t~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [936] $Ultimate##0-->thread3EXIT: Formula: (and (= v_~z~0_135 (+ v_~z~0_136 v_~C~0_143)) (= |v_thread3Thread1of1ForFork0_~k~0#1_81| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_53| 0)) (= (ite (and (<= 0 v_~q2_front~0_177) (< v_~q2_front~0_177 v_~n2~0_162) (< v_~q2_front~0_177 v_~q2_back~0_210)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|) (= |v_thread3Thread1of1ForFork0_#res#1.base_37| 0) (= v_~t~0_146 (+ v_~t~0_147 |v_thread3Thread1of1ForFork0_~k~0#1_81|)) (= |v_thread1Thread1of1ForFork1_~i~0#1_59| 0) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_59| v_~N~0_101)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45| (ite (= (select (select |v_#memory_int_297| v_~q1~0.base_124) (+ (* v_~q1_back~0_211 4) v_~q1~0.offset_124)) 0) 1 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread3Thread1of1ForFork0_~k~0#1_81| (select (select |v_#memory_int_297| v_~q2~0.base_135) (+ (* v_~q2_front~0_177 4) v_~q2~0.offset_135))) (= (+ v_~q1_back~0_211 1) v_~q1_back~0_210) (= |v_thread3Thread1of1ForFork0_#res#1.offset_37| 0) (= v_~q2_front~0_176 (+ v_~q2_front~0_177 1)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_23| 0) (= v_~x~0_113 (+ v_~x~0_114 v_~C~0_143)) (not (= (ite (and (<= 0 v_~q1_back~0_211) (< v_~q1_back~0_211 v_~n1~0_127)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_#res#1.base_23| 0)) InVars {~q1~0.offset=v_~q1~0.offset_124, ~n2~0=v_~n2~0_162, ~C~0=v_~C~0_143, ~q2~0.offset=v_~q2~0.offset_135, ~n1~0=v_~n1~0_127, ~q2_front~0=v_~q2_front~0_177, ~N~0=v_~N~0_101, ~q1_back~0=v_~q1_back~0_211, ~q1~0.base=v_~q1~0.base_124, #memory_int=|v_#memory_int_297|, ~q2~0.base=v_~q2~0.base_135, ~z~0=v_~z~0_136, ~x~0=v_~x~0_114, ~q2_back~0=v_~q2_back~0_210, ~t~0=v_~t~0_147} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_53|, ~q2~0.offset=v_~q2~0.offset_135, ~n1~0=v_~n1~0_127, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_37|, ~q1_back~0=v_~q1_back~0_210, ~q1~0.base=v_~q1~0.base_124, ~q2~0.base=v_~q2~0.base_135, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_23|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_23|, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_81|, ~q2_back~0=v_~q2_back~0_210, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_53|, ~q1~0.offset=v_~q1~0.offset_124, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_23|, ~n2~0=v_~n2~0_162, ~C~0=v_~C~0_143, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_53|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_23|, ~q2_front~0=v_~q2_front~0_176, ~N~0=v_~N~0_101, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_37|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_59|, #memory_int=|v_#memory_int_297|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_53|, ~z~0=v_~z~0_135, ~x~0=v_~x~0_113, ~t~0=v_~t~0_146} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread3Thread1of1ForFork0_#res#1.base, ~q2_front~0, thread3Thread1of1ForFork0_#res#1.offset, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread3Thread1of1ForFork0_#t~post11#1, thread1Thread1of1ForFork1_#res#1.offset, ~z~0, thread1Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork0_~k~0#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~t~0] [2022-12-13 02:10:21,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-13 02:10:21,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-13 02:10:21,560 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:10:21,561 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1944 [2022-12-13 02:10:21,561 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 61 transitions, 399 flow [2022-12-13 02:10:21,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-12-13 02:10:21,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:21,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:21,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:10:21,561 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:21,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash 630358944, now seen corresponding path program 3 times [2022-12-13 02:10:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:21,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690209393] [2022-12-13 02:10:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:22,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:22,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690209393] [2022-12-13 02:10:22,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690209393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:22,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:22,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:10:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528289555] [2022-12-13 02:10:22,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:22,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:10:22,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:22,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:10:22,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:10:22,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-13 02:10:22,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 61 transitions, 399 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-12-13 02:10:22,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:22,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-13 02:10:22,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:22,710 INFO L130 PetriNetUnfolder]: 439/652 cut-off events. [2022-12-13 02:10:22,710 INFO L131 PetriNetUnfolder]: For 515/522 co-relation queries the response was YES. [2022-12-13 02:10:22,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 652 events. 439/652 cut-off events. For 515/522 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2174 event pairs, 35 based on Foata normal form. 8/485 useless extension candidates. Maximal degree in co-relation 2186. Up to 504 conditions per place. [2022-12-13 02:10:22,715 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 60 selfloop transitions, 32 changer transitions 5/98 dead transitions. [2022-12-13 02:10:22,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 98 transitions, 712 flow [2022-12-13 02:10:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:10:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:10:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-13 02:10:22,717 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-13 02:10:22,717 INFO L175 Difference]: Start difference. First operand has 46 places, 61 transitions, 399 flow. Second operand 8 states and 96 transitions. [2022-12-13 02:10:22,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 98 transitions, 712 flow [2022-12-13 02:10:22,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 657 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-13 02:10:22,722 INFO L231 Difference]: Finished difference. Result has 53 places, 66 transitions, 475 flow [2022-12-13 02:10:22,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=475, PETRI_PLACES=53, PETRI_TRANSITIONS=66} [2022-12-13 02:10:22,722 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2022-12-13 02:10:22,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:22,723 INFO L89 Accepts]: Start accepts. Operand has 53 places, 66 transitions, 475 flow [2022-12-13 02:10:22,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:22,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:22,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 66 transitions, 475 flow [2022-12-13 02:10:22,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 66 transitions, 475 flow [2022-12-13 02:10:22,740 INFO L130 PetriNetUnfolder]: 64/144 cut-off events. [2022-12-13 02:10:22,741 INFO L131 PetriNetUnfolder]: For 125/127 co-relation queries the response was YES. [2022-12-13 02:10:22,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 144 events. 64/144 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 500 event pairs, 1 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 374. Up to 59 conditions per place. [2022-12-13 02:10:22,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 66 transitions, 475 flow [2022-12-13 02:10:22,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-13 02:10:22,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] [2022-12-13 02:10:22,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] and [880] L75-->L70-2: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|) (= (+ v_~s~0_48 |v_thread2Thread1of1ForFork2_~j~0#1_43|) v_~s~0_47) (not (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_43|)) (= v_~q2_back~0_90 (+ v_~q2_back~0_91 1)) (= (ite (= (select (select |v_#memory_int_187| v_~q2~0.base_59) (+ v_~q2~0.offset_59 (* v_~q2_back~0_91 4))) |v_thread2Thread1of1ForFork2_~j~0#1_43|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31| 0)) (= v_~y~0_37 (+ v_~y~0_38 v_~C~0_59)) (not (= (ite (and (<= 0 v_~q2_back~0_91) (< v_~q2_back~0_91 v_~n2~0_78)) 1 0) 0))) InVars {~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, ~y~0=v_~y~0_38, ~q2_back~0=v_~q2_back~0_91, ~s~0=v_~s~0_48} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_17|, ~n2~0=v_~n2~0_78, ~C~0=v_~C~0_59, ~q2~0.offset=v_~q2~0.offset_59, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_31|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_43|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_187|, ~q2~0.base=v_~q2~0.base_59, ~y~0=v_~y~0_37, ~q2_back~0=v_~q2_back~0_90, ~s~0=v_~s~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, ~q2_back~0, ~s~0] [2022-12-13 02:10:23,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:10:23,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 530 [2022-12-13 02:10:23,253 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 65 transitions, 478 flow [2022-12-13 02:10:23,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-12-13 02:10:23,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:23,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:23,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:10:23,254 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash 896236631, now seen corresponding path program 1 times [2022-12-13 02:10:23,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:23,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617733005] [2022-12-13 02:10:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:23,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:23,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617733005] [2022-12-13 02:10:23,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617733005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:23,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:23,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:10:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797733469] [2022-12-13 02:10:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:23,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:10:23,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:23,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:10:23,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:10:23,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-13 02:10:23,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 65 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-12-13 02:10:23,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:23,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-13 02:10:23,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:23,488 INFO L130 PetriNetUnfolder]: 405/602 cut-off events. [2022-12-13 02:10:23,489 INFO L131 PetriNetUnfolder]: For 968/968 co-relation queries the response was YES. [2022-12-13 02:10:23,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 602 events. 405/602 cut-off events. For 968/968 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1914 event pairs, 64 based on Foata normal form. 24/481 useless extension candidates. Maximal degree in co-relation 2281. Up to 446 conditions per place. [2022-12-13 02:10:23,493 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 55 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2022-12-13 02:10:23,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 548 flow [2022-12-13 02:10:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:10:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:10:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 02:10:23,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-13 02:10:23,495 INFO L175 Difference]: Start difference. First operand has 50 places, 65 transitions, 478 flow. Second operand 3 states and 60 transitions. [2022-12-13 02:10:23,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 548 flow [2022-12-13 02:10:23,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 470 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-12-13 02:10:23,499 INFO L231 Difference]: Finished difference. Result has 44 places, 56 transitions, 349 flow [2022-12-13 02:10:23,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=44, PETRI_TRANSITIONS=56} [2022-12-13 02:10:23,501 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2022-12-13 02:10:23,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:23,501 INFO L89 Accepts]: Start accepts. Operand has 44 places, 56 transitions, 349 flow [2022-12-13 02:10:23,502 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:23,502 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:23,502 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 56 transitions, 349 flow [2022-12-13 02:10:23,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 56 transitions, 349 flow [2022-12-13 02:10:23,516 INFO L130 PetriNetUnfolder]: 46/113 cut-off events. [2022-12-13 02:10:23,516 INFO L131 PetriNetUnfolder]: For 67/68 co-relation queries the response was YES. [2022-12-13 02:10:23,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 113 events. 46/113 cut-off events. For 67/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 379 event pairs, 2 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 279. Up to 49 conditions per place. [2022-12-13 02:10:23,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 56 transitions, 349 flow [2022-12-13 02:10:23,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-13 02:10:23,519 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:23,521 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 02:10:23,521 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 56 transitions, 349 flow [2022-12-13 02:10:23,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-12-13 02:10:23,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:23,521 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:23,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 02:10:23,522 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2137701280, now seen corresponding path program 1 times [2022-12-13 02:10:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:23,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994118636] [2022-12-13 02:10:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:23,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:23,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:23,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994118636] [2022-12-13 02:10:23,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994118636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:23,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:23,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:10:23,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657910337] [2022-12-13 02:10:23,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:23,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:10:23,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:23,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:10:23,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:10:23,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:10:23,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 56 transitions, 349 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-12-13 02:10:23,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:23,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:10:23,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:24,108 INFO L130 PetriNetUnfolder]: 832/1267 cut-off events. [2022-12-13 02:10:24,108 INFO L131 PetriNetUnfolder]: For 1259/1259 co-relation queries the response was YES. [2022-12-13 02:10:24,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 1267 events. 832/1267 cut-off events. For 1259/1259 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5042 event pairs, 116 based on Foata normal form. 28/998 useless extension candidates. Maximal degree in co-relation 3797. Up to 453 conditions per place. [2022-12-13 02:10:24,116 INFO L137 encePairwiseOnDemand]: 24/39 looper letters, 104 selfloop transitions, 24 changer transitions 3/131 dead transitions. [2022-12-13 02:10:24,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 131 transitions, 986 flow [2022-12-13 02:10:24,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:10:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:10:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-13 02:10:24,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3992673992673993 [2022-12-13 02:10:24,118 INFO L175 Difference]: Start difference. First operand has 43 places, 56 transitions, 349 flow. Second operand 7 states and 109 transitions. [2022-12-13 02:10:24,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 131 transitions, 986 flow [2022-12-13 02:10:24,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 131 transitions, 969 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 02:10:24,126 INFO L231 Difference]: Finished difference. Result has 51 places, 70 transitions, 536 flow [2022-12-13 02:10:24,126 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=536, PETRI_PLACES=51, PETRI_TRANSITIONS=70} [2022-12-13 02:10:24,126 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-13 02:10:24,127 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:24,127 INFO L89 Accepts]: Start accepts. Operand has 51 places, 70 transitions, 536 flow [2022-12-13 02:10:24,127 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:24,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:24,128 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 70 transitions, 536 flow [2022-12-13 02:10:24,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 70 transitions, 536 flow [2022-12-13 02:10:24,153 INFO L130 PetriNetUnfolder]: 81/223 cut-off events. [2022-12-13 02:10:24,153 INFO L131 PetriNetUnfolder]: For 241/243 co-relation queries the response was YES. [2022-12-13 02:10:24,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 223 events. 81/223 cut-off events. For 241/243 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1038 event pairs, 4 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 566. Up to 96 conditions per place. [2022-12-13 02:10:24,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 70 transitions, 536 flow [2022-12-13 02:10:24,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-13 02:10:24,972 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:10:24,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 846 [2022-12-13 02:10:24,973 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 69 transitions, 533 flow [2022-12-13 02:10:24,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-12-13 02:10:24,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:24,974 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:24,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 02:10:24,974 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1346060070, now seen corresponding path program 1 times [2022-12-13 02:10:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:24,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497276063] [2022-12-13 02:10:24,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:24,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:25,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497276063] [2022-12-13 02:10:25,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497276063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:25,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:25,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:10:25,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108594455] [2022-12-13 02:10:25,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:25,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:10:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:25,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:10:25,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:10:25,086 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 02:10:25,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 69 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-12-13 02:10:25,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:25,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 02:10:25,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:25,496 INFO L130 PetriNetUnfolder]: 1361/2145 cut-off events. [2022-12-13 02:10:25,496 INFO L131 PetriNetUnfolder]: For 3894/3894 co-relation queries the response was YES. [2022-12-13 02:10:25,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8603 conditions, 2145 events. 1361/2145 cut-off events. For 3894/3894 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10074 event pairs, 477 based on Foata normal form. 88/1785 useless extension candidates. Maximal degree in co-relation 7096. Up to 1218 conditions per place. [2022-12-13 02:10:25,511 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 159 selfloop transitions, 8 changer transitions 8/175 dead transitions. [2022-12-13 02:10:25,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 175 transitions, 1580 flow [2022-12-13 02:10:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:10:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:10:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-12-13 02:10:25,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2022-12-13 02:10:25,513 INFO L175 Difference]: Start difference. First operand has 50 places, 69 transitions, 533 flow. Second operand 7 states and 117 transitions. [2022-12-13 02:10:25,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 175 transitions, 1580 flow [2022-12-13 02:10:25,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 175 transitions, 1500 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 02:10:25,551 INFO L231 Difference]: Finished difference. Result has 58 places, 76 transitions, 587 flow [2022-12-13 02:10:25,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=587, PETRI_PLACES=58, PETRI_TRANSITIONS=76} [2022-12-13 02:10:25,552 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2022-12-13 02:10:25,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:25,552 INFO L89 Accepts]: Start accepts. Operand has 58 places, 76 transitions, 587 flow [2022-12-13 02:10:25,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:25,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:25,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 76 transitions, 587 flow [2022-12-13 02:10:25,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 76 transitions, 587 flow [2022-12-13 02:10:25,595 INFO L130 PetriNetUnfolder]: 125/358 cut-off events. [2022-12-13 02:10:25,595 INFO L131 PetriNetUnfolder]: For 401/413 co-relation queries the response was YES. [2022-12-13 02:10:25,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 358 events. 125/358 cut-off events. For 401/413 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1994 event pairs, 4 based on Foata normal form. 4/271 useless extension candidates. Maximal degree in co-relation 889. Up to 139 conditions per place. [2022-12-13 02:10:25,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 76 transitions, 587 flow [2022-12-13 02:10:25,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-13 02:10:33,431 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:10:33,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7879 [2022-12-13 02:10:33,432 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 76 transitions, 600 flow [2022-12-13 02:10:33,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-12-13 02:10:33,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:33,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:33,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 02:10:33,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2104121282, now seen corresponding path program 1 times [2022-12-13 02:10:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:33,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38051472] [2022-12-13 02:10:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:33,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:33,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38051472] [2022-12-13 02:10:33,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38051472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:33,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:33,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:10:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186317078] [2022-12-13 02:10:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:33,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:10:33,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:33,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:10:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:10:33,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 02:10:33,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 76 transitions, 600 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:33,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:33,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 02:10:33,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:34,478 INFO L130 PetriNetUnfolder]: 1442/2242 cut-off events. [2022-12-13 02:10:34,478 INFO L131 PetriNetUnfolder]: For 4034/4034 co-relation queries the response was YES. [2022-12-13 02:10:34,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9288 conditions, 2242 events. 1442/2242 cut-off events. For 4034/4034 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10440 event pairs, 180 based on Foata normal form. 0/1791 useless extension candidates. Maximal degree in co-relation 7793. Up to 1419 conditions per place. [2022-12-13 02:10:34,499 INFO L137 encePairwiseOnDemand]: 20/43 looper letters, 94 selfloop transitions, 42 changer transitions 1/137 dead transitions. [2022-12-13 02:10:34,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 137 transitions, 1194 flow [2022-12-13 02:10:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:10:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:10:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-12-13 02:10:34,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3289036544850498 [2022-12-13 02:10:34,501 INFO L175 Difference]: Start difference. First operand has 58 places, 76 transitions, 600 flow. Second operand 7 states and 99 transitions. [2022-12-13 02:10:34,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 137 transitions, 1194 flow [2022-12-13 02:10:34,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 1150 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-13 02:10:34,567 INFO L231 Difference]: Finished difference. Result has 68 places, 92 transitions, 863 flow [2022-12-13 02:10:34,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=863, PETRI_PLACES=68, PETRI_TRANSITIONS=92} [2022-12-13 02:10:34,567 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2022-12-13 02:10:34,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:34,567 INFO L89 Accepts]: Start accepts. Operand has 68 places, 92 transitions, 863 flow [2022-12-13 02:10:34,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:34,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:34,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 92 transitions, 863 flow [2022-12-13 02:10:34,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 92 transitions, 863 flow [2022-12-13 02:10:34,645 INFO L130 PetriNetUnfolder]: 223/557 cut-off events. [2022-12-13 02:10:34,645 INFO L131 PetriNetUnfolder]: For 1080/1124 co-relation queries the response was YES. [2022-12-13 02:10:34,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 557 events. 223/557 cut-off events. For 1080/1124 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3235 event pairs, 4 based on Foata normal form. 10/502 useless extension candidates. Maximal degree in co-relation 1751. Up to 171 conditions per place. [2022-12-13 02:10:34,651 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 92 transitions, 863 flow [2022-12-13 02:10:34,651 INFO L226 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-13 02:10:34,658 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:34,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:10:34,659 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 92 transitions, 863 flow [2022-12-13 02:10:34,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:34,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:34,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:34,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 02:10:34,660 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1531388098, now seen corresponding path program 1 times [2022-12-13 02:10:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:34,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256365252] [2022-12-13 02:10:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:34,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:34,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256365252] [2022-12-13 02:10:34,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256365252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:34,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:34,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:10:34,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598605339] [2022-12-13 02:10:34,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:34,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:10:34,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:34,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:10:34,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:10:34,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 02:10:34,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 92 transitions, 863 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-12-13 02:10:34,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:34,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 02:10:34,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:35,255 INFO L130 PetriNetUnfolder]: 1853/2932 cut-off events. [2022-12-13 02:10:35,255 INFO L131 PetriNetUnfolder]: For 8816/8816 co-relation queries the response was YES. [2022-12-13 02:10:35,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12987 conditions, 2932 events. 1853/2932 cut-off events. For 8816/8816 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14730 event pairs, 304 based on Foata normal form. 124/2633 useless extension candidates. Maximal degree in co-relation 12360. Up to 1191 conditions per place. [2022-12-13 02:10:35,282 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 100 selfloop transitions, 21 changer transitions 12/133 dead transitions. [2022-12-13 02:10:35,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 133 transitions, 1326 flow [2022-12-13 02:10:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:10:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:10:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-13 02:10:35,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2022-12-13 02:10:35,284 INFO L175 Difference]: Start difference. First operand has 67 places, 92 transitions, 863 flow. Second operand 4 states and 73 transitions. [2022-12-13 02:10:35,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 133 transitions, 1326 flow [2022-12-13 02:10:35,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 133 transitions, 1267 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-13 02:10:35,327 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 618 flow [2022-12-13 02:10:35,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=618, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2022-12-13 02:10:35,328 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2022-12-13 02:10:35,328 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:35,328 INFO L89 Accepts]: Start accepts. Operand has 69 places, 72 transitions, 618 flow [2022-12-13 02:10:35,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:35,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:35,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 72 transitions, 618 flow [2022-12-13 02:10:35,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 72 transitions, 618 flow [2022-12-13 02:10:35,393 INFO L130 PetriNetUnfolder]: 227/622 cut-off events. [2022-12-13 02:10:35,393 INFO L131 PetriNetUnfolder]: For 1167/1311 co-relation queries the response was YES. [2022-12-13 02:10:35,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2364 conditions, 622 events. 227/622 cut-off events. For 1167/1311 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3870 event pairs, 15 based on Foata normal form. 24/541 useless extension candidates. Maximal degree in co-relation 2309. Up to 185 conditions per place. [2022-12-13 02:10:35,400 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 72 transitions, 618 flow [2022-12-13 02:10:35,400 INFO L226 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-13 02:10:35,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:10:35,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [939] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_65| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_25| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_25| 0) (not (= (ite (and (<= 0 v_~q1_back~0_215) (< v_~q1_back~0_215 v_~n1~0_129)) 1 0) 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_65| v_~N~0_103)) (= v_~t~0_158 0) (= (+ v_~x~0_118 v_~C~0_149) v_~x~0_117) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| (ite (= (select (select |v_#memory_int_303| v_~q1~0.base_126) (+ (* v_~q1_back~0_215 4) v_~q1~0.offset_126)) 0) 1 0)) (= (+ v_~q1_back~0_215 1) v_~q1_back~0_214) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|)) InVars {~q1~0.offset=v_~q1~0.offset_126, ~C~0=v_~C~0_149, ~q1_back~0=v_~q1_back~0_215, ~n1~0=v_~n1~0_129, ~q1~0.base=v_~q1~0.base_126, #memory_int=|v_#memory_int_303|, ~N~0=v_~N~0_103, ~x~0=v_~x~0_118} OutVars{~q1~0.offset=v_~q1~0.offset_126, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_25|, ~C~0=v_~C~0_149, ~n1~0=v_~n1~0_129, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_25|, ~N~0=v_~N~0_103, ~q1_back~0=v_~q1_back~0_214, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_65|, ~q1~0.base=v_~q1~0.base_126, #memory_int=|v_#memory_int_303|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_25|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_25|, ~x~0=v_~x~0_117, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_91|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, ~t~0=v_~t~0_158} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread3Thread1of1ForFork0_~k~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~t~0] and [954] L75-->L94-2: Formula: (let ((.cse0 (select |v_#memory_int_353| v_~q2~0.base_167))) (and (not (= (ite (and (<= 0 v_~q2_back~0_247) (< v_~q2_back~0_247 v_~n2~0_194)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_~j~0#1_105| 0) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_119| 0)) (= v_~y~0_157 (+ v_~y~0_158 v_~C~0_175)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_91| (ite (= (select .cse0 (+ v_~q2~0.offset_167 (* 4 v_~q2_back~0_247))) |v_thread2Thread1of1ForFork2_~j~0#1_105|) 1 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_37| 0) (= v_~q2_front~0_226 (+ v_~q2_front~0_227 1)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_75| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75| (ite (and (< v_~q2_front~0_227 v_~q2_back~0_246) (<= 0 v_~q2_front~0_227) (< v_~q2_front~0_227 v_~n2~0_194)) 1 0)) (= (+ v_~q2_back~0_247 1) v_~q2_back~0_246) (= |v_thread2Thread1of1ForFork2_#res#1.base_37| 0) (= v_~t~0_200 (+ v_~t~0_201 |v_thread3Thread1of1ForFork0_~k~0#1_119|)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_91| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_91| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_91|) (= (select .cse0 (+ v_~q2~0.offset_167 (* v_~q2_front~0_227 4))) |v_thread3Thread1of1ForFork0_~k~0#1_119|) (= (+ v_~z~0_186 v_~C~0_175) v_~z~0_185) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_75|) (= (+ v_~s~0_168 |v_thread2Thread1of1ForFork2_~j~0#1_105|) v_~s~0_167))) InVars {~n2~0=v_~n2~0_194, ~C~0=v_~C~0_175, ~q2~0.offset=v_~q2~0.offset_167, #memory_int=|v_#memory_int_353|, ~q2_front~0=v_~q2_front~0_227, ~q2~0.base=v_~q2~0.base_167, ~z~0=v_~z~0_186, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_105|, ~y~0=v_~y~0_158, ~q2_back~0=v_~q2_back~0_247, ~t~0=v_~t~0_201, ~s~0=v_~s~0_168} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_67|, thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_75|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|, ~n2~0=v_~n2~0_194, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_37|, ~C~0=v_~C~0_175, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_75|, ~q2~0.offset=v_~q2~0.offset_167, ~q2_front~0=v_~q2_front~0_226, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_105|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_67|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_37|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_91|, #memory_int=|v_#memory_int_353|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_75|, ~q2~0.base=v_~q2~0.base_167, ~z~0=v_~z~0_185, ~y~0=v_~y~0_157, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_119|, ~q2_back~0=v_~q2_back~0_246, ~t~0=v_~t~0_200, ~s~0=v_~s~0_167} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~q2_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~z~0, ~y~0, thread3Thread1of1ForFork0_~k~0#1, ~q2_back~0, ~t~0, ~s~0] [2022-12-13 02:10:43,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:10:44,041 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:10:44,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8714 [2022-12-13 02:10:44,042 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 643 flow [2022-12-13 02:10:44,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-12-13 02:10:44,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:44,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:44,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 02:10:44,042 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:44,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2039828831, now seen corresponding path program 1 times [2022-12-13 02:10:44,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:44,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104014134] [2022-12-13 02:10:44,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:44,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:44,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104014134] [2022-12-13 02:10:44,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104014134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:44,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:44,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:10:44,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029657525] [2022-12-13 02:10:44,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:44,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:10:44,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:10:44,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:10:44,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:10:44,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 643 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-13 02:10:44,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:44,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:10:44,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:45,034 INFO L130 PetriNetUnfolder]: 2013/3193 cut-off events. [2022-12-13 02:10:45,034 INFO L131 PetriNetUnfolder]: For 11722/11722 co-relation queries the response was YES. [2022-12-13 02:10:45,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15118 conditions, 3193 events. 2013/3193 cut-off events. For 11722/11722 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16408 event pairs, 349 based on Foata normal form. 54/2772 useless extension candidates. Maximal degree in co-relation 14774. Up to 1778 conditions per place. [2022-12-13 02:10:45,052 INFO L137 encePairwiseOnDemand]: 24/39 looper letters, 94 selfloop transitions, 23 changer transitions 2/119 dead transitions. [2022-12-13 02:10:45,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 1149 flow [2022-12-13 02:10:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:10:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:10:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-13 02:10:45,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36752136752136755 [2022-12-13 02:10:45,054 INFO L175 Difference]: Start difference. First operand has 65 places, 70 transitions, 643 flow. Second operand 6 states and 86 transitions. [2022-12-13 02:10:45,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 1149 flow [2022-12-13 02:10:45,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 1115 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 02:10:45,088 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 706 flow [2022-12-13 02:10:45,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=706, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2022-12-13 02:10:45,089 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2022-12-13 02:10:45,090 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:45,090 INFO L89 Accepts]: Start accepts. Operand has 71 places, 72 transitions, 706 flow [2022-12-13 02:10:45,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:45,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:45,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 72 transitions, 706 flow [2022-12-13 02:10:45,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 72 transitions, 706 flow [2022-12-13 02:10:45,173 INFO L130 PetriNetUnfolder]: 253/749 cut-off events. [2022-12-13 02:10:45,174 INFO L131 PetriNetUnfolder]: For 2305/2460 co-relation queries the response was YES. [2022-12-13 02:10:45,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3215 conditions, 749 events. 253/749 cut-off events. For 2305/2460 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5109 event pairs, 19 based on Foata normal form. 18/640 useless extension candidates. Maximal degree in co-relation 3189. Up to 221 conditions per place. [2022-12-13 02:10:45,184 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 72 transitions, 706 flow [2022-12-13 02:10:45,184 INFO L226 LiptonReduction]: Number of co-enabled transitions 628 [2022-12-13 02:10:45,185 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:45,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 02:10:45,185 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 706 flow [2022-12-13 02:10:45,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-13 02:10:45,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:45,186 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:45,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 02:10:45,186 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:45,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:45,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1415895634, now seen corresponding path program 1 times [2022-12-13 02:10:45,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:45,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955828373] [2022-12-13 02:10:45,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:45,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955828373] [2022-12-13 02:10:45,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955828373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:45,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:45,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:10:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461366410] [2022-12-13 02:10:45,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:45,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:10:45,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:45,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:10:45,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:10:45,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 02:10:45,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 706 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-13 02:10:45,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:45,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 02:10:45,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:45,762 INFO L130 PetriNetUnfolder]: 1997/3176 cut-off events. [2022-12-13 02:10:45,762 INFO L131 PetriNetUnfolder]: For 16289/16289 co-relation queries the response was YES. [2022-12-13 02:10:45,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16442 conditions, 3176 events. 1997/3176 cut-off events. For 16289/16289 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16263 event pairs, 346 based on Foata normal form. 16/2718 useless extension candidates. Maximal degree in co-relation 16414. Up to 2220 conditions per place. [2022-12-13 02:10:45,783 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 64 selfloop transitions, 15 changer transitions 3/82 dead transitions. [2022-12-13 02:10:45,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 940 flow [2022-12-13 02:10:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:10:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:10:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 02:10:45,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42342342342342343 [2022-12-13 02:10:45,785 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 706 flow. Second operand 3 states and 47 transitions. [2022-12-13 02:10:45,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 940 flow [2022-12-13 02:10:45,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 912 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 02:10:45,809 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 646 flow [2022-12-13 02:10:45,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2022-12-13 02:10:45,810 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2022-12-13 02:10:45,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:45,810 INFO L89 Accepts]: Start accepts. Operand has 68 places, 67 transitions, 646 flow [2022-12-13 02:10:45,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:45,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:45,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 646 flow [2022-12-13 02:10:45,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 67 transitions, 646 flow [2022-12-13 02:10:45,885 INFO L130 PetriNetUnfolder]: 241/703 cut-off events. [2022-12-13 02:10:45,885 INFO L131 PetriNetUnfolder]: For 2263/2406 co-relation queries the response was YES. [2022-12-13 02:10:45,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 703 events. 241/703 cut-off events. For 2263/2406 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4673 event pairs, 19 based on Foata normal form. 18/598 useless extension candidates. Maximal degree in co-relation 2949. Up to 217 conditions per place. [2022-12-13 02:10:45,894 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 67 transitions, 646 flow [2022-12-13 02:10:45,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-13 02:10:45,896 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:45,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 02:10:45,897 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 646 flow [2022-12-13 02:10:45,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-13 02:10:45,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:45,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:45,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 02:10:45,899 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:45,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2053560279, now seen corresponding path program 2 times [2022-12-13 02:10:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:45,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865707337] [2022-12-13 02:10:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:46,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865707337] [2022-12-13 02:10:46,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865707337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:46,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:46,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:10:46,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984193748] [2022-12-13 02:10:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:46,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:10:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:10:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:10:46,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:10:46,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 646 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-13 02:10:46,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:46,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:10:46,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:46,749 INFO L130 PetriNetUnfolder]: 1888/2931 cut-off events. [2022-12-13 02:10:46,749 INFO L131 PetriNetUnfolder]: For 17067/17067 co-relation queries the response was YES. [2022-12-13 02:10:46,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15560 conditions, 2931 events. 1888/2931 cut-off events. For 17067/17067 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14202 event pairs, 282 based on Foata normal form. 64/2537 useless extension candidates. Maximal degree in co-relation 14657. Up to 1671 conditions per place. [2022-12-13 02:10:46,772 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 84 selfloop transitions, 27 changer transitions 14/125 dead transitions. [2022-12-13 02:10:46,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 125 transitions, 1308 flow [2022-12-13 02:10:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:10:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:10:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-13 02:10:46,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36134453781512604 [2022-12-13 02:10:46,774 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 646 flow. Second operand 7 states and 86 transitions. [2022-12-13 02:10:46,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 125 transitions, 1308 flow [2022-12-13 02:10:46,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 1246 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 02:10:46,843 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 746 flow [2022-12-13 02:10:46,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=746, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2022-12-13 02:10:46,844 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 40 predicate places. [2022-12-13 02:10:46,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:46,844 INFO L89 Accepts]: Start accepts. Operand has 72 places, 73 transitions, 746 flow [2022-12-13 02:10:46,845 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:46,845 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:46,845 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 73 transitions, 746 flow [2022-12-13 02:10:46,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 746 flow [2022-12-13 02:10:46,925 INFO L130 PetriNetUnfolder]: 294/738 cut-off events. [2022-12-13 02:10:46,925 INFO L131 PetriNetUnfolder]: For 2495/2594 co-relation queries the response was YES. [2022-12-13 02:10:46,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 738 events. 294/738 cut-off events. For 2495/2594 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4493 event pairs, 25 based on Foata normal form. 15/619 useless extension candidates. Maximal degree in co-relation 3260. Up to 273 conditions per place. [2022-12-13 02:10:46,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 73 transitions, 746 flow [2022-12-13 02:10:46,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-13 02:10:46,936 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:46,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 02:10:46,936 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 746 flow [2022-12-13 02:10:46,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-13 02:10:46,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:46,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:46,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 02:10:46,937 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:46,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2119710717, now seen corresponding path program 1 times [2022-12-13 02:10:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:46,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461115561] [2022-12-13 02:10:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:47,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:47,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461115561] [2022-12-13 02:10:47,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461115561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:47,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:47,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:10:47,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202941554] [2022-12-13 02:10:47,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:47,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:10:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:47,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:10:47,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:10:47,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:10:47,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 746 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:47,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:47,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:10:47,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:48,017 INFO L130 PetriNetUnfolder]: 2000/3075 cut-off events. [2022-12-13 02:10:48,018 INFO L131 PetriNetUnfolder]: For 17569/17569 co-relation queries the response was YES. [2022-12-13 02:10:48,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16710 conditions, 3075 events. 2000/3075 cut-off events. For 17569/17569 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14853 event pairs, 283 based on Foata normal form. 28/2623 useless extension candidates. Maximal degree in co-relation 15790. Up to 1843 conditions per place. [2022-12-13 02:10:48,036 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 88 selfloop transitions, 27 changer transitions 0/115 dead transitions. [2022-12-13 02:10:48,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 115 transitions, 1253 flow [2022-12-13 02:10:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:10:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:10:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-13 02:10:48,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37745098039215685 [2022-12-13 02:10:48,038 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 746 flow. Second operand 6 states and 77 transitions. [2022-12-13 02:10:48,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 115 transitions, 1253 flow [2022-12-13 02:10:48,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 1144 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-12-13 02:10:48,082 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 824 flow [2022-12-13 02:10:48,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=824, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2022-12-13 02:10:48,082 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2022-12-13 02:10:48,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:48,082 INFO L89 Accepts]: Start accepts. Operand has 71 places, 79 transitions, 824 flow [2022-12-13 02:10:48,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:48,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:48,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 79 transitions, 824 flow [2022-12-13 02:10:48,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 79 transitions, 824 flow [2022-12-13 02:10:48,166 INFO L130 PetriNetUnfolder]: 312/794 cut-off events. [2022-12-13 02:10:48,167 INFO L131 PetriNetUnfolder]: For 2642/2758 co-relation queries the response was YES. [2022-12-13 02:10:48,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3636 conditions, 794 events. 312/794 cut-off events. For 2642/2758 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5073 event pairs, 23 based on Foata normal form. 20/663 useless extension candidates. Maximal degree in co-relation 3474. Up to 291 conditions per place. [2022-12-13 02:10:48,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 79 transitions, 824 flow [2022-12-13 02:10:48,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 676 [2022-12-13 02:10:48,177 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:48,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 02:10:48,178 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 824 flow [2022-12-13 02:10:48,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:48,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:48,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:48,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 02:10:48,178 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:48,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:48,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1260350730, now seen corresponding path program 1 times [2022-12-13 02:10:48,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:48,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465486036] [2022-12-13 02:10:48,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:48,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:48,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465486036] [2022-12-13 02:10:48,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465486036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:48,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:48,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:10:48,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896054527] [2022-12-13 02:10:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:48,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:10:48,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:48,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:10:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:10:48,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:10:48,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 824 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-12-13 02:10:48,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:48,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:10:48,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:48,950 INFO L130 PetriNetUnfolder]: 3129/4864 cut-off events. [2022-12-13 02:10:48,950 INFO L131 PetriNetUnfolder]: For 27646/27646 co-relation queries the response was YES. [2022-12-13 02:10:48,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26630 conditions, 4864 events. 3129/4864 cut-off events. For 27646/27646 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 25599 event pairs, 495 based on Foata normal form. 66/4120 useless extension candidates. Maximal degree in co-relation 25872. Up to 1859 conditions per place. [2022-12-13 02:10:48,979 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 92 selfloop transitions, 27 changer transitions 6/125 dead transitions. [2022-12-13 02:10:48,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 125 transitions, 1437 flow [2022-12-13 02:10:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:10:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:10:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 02:10:48,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 02:10:48,980 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 824 flow. Second operand 4 states and 68 transitions. [2022-12-13 02:10:48,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 125 transitions, 1437 flow [2022-12-13 02:10:49,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 125 transitions, 1407 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 02:10:49,011 INFO L231 Difference]: Finished difference. Result has 74 places, 83 transitions, 944 flow [2022-12-13 02:10:49,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=944, PETRI_PLACES=74, PETRI_TRANSITIONS=83} [2022-12-13 02:10:49,012 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2022-12-13 02:10:49,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:49,012 INFO L89 Accepts]: Start accepts. Operand has 74 places, 83 transitions, 944 flow [2022-12-13 02:10:49,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:49,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:49,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 83 transitions, 944 flow [2022-12-13 02:10:49,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 83 transitions, 944 flow [2022-12-13 02:10:49,117 INFO L130 PetriNetUnfolder]: 357/994 cut-off events. [2022-12-13 02:10:49,117 INFO L131 PetriNetUnfolder]: For 3933/4132 co-relation queries the response was YES. [2022-12-13 02:10:49,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5041 conditions, 994 events. 357/994 cut-off events. For 3933/4132 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6941 event pairs, 30 based on Foata normal form. 31/831 useless extension candidates. Maximal degree in co-relation 4838. Up to 317 conditions per place. [2022-12-13 02:10:49,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 83 transitions, 944 flow [2022-12-13 02:10:49,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 846 [2022-12-13 02:10:49,128 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:49,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:10:49,129 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 83 transitions, 944 flow [2022-12-13 02:10:49,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-12-13 02:10:49,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:49,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:49,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 02:10:49,129 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 558463201, now seen corresponding path program 2 times [2022-12-13 02:10:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:49,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832872401] [2022-12-13 02:10:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832872401] [2022-12-13 02:10:49,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832872401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:49,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:49,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:10:49,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803800686] [2022-12-13 02:10:49,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:49,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:10:49,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:49,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:10:49,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:10:49,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:10:49,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 83 transitions, 944 flow. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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) [2022-12-13 02:10:49,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:49,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:10:49,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:50,531 INFO L130 PetriNetUnfolder]: 3713/5764 cut-off events. [2022-12-13 02:10:50,531 INFO L131 PetriNetUnfolder]: For 43122/43122 co-relation queries the response was YES. [2022-12-13 02:10:50,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34009 conditions, 5764 events. 3713/5764 cut-off events. For 43122/43122 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 31887 event pairs, 454 based on Foata normal form. 56/4802 useless extension candidates. Maximal degree in co-relation 25637. Up to 2857 conditions per place. [2022-12-13 02:10:50,564 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 136 selfloop transitions, 41 changer transitions 4/181 dead transitions. [2022-12-13 02:10:50,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 181 transitions, 2164 flow [2022-12-13 02:10:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:10:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:10:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-12-13 02:10:50,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2022-12-13 02:10:50,565 INFO L175 Difference]: Start difference. First operand has 69 places, 83 transitions, 944 flow. Second operand 9 states and 105 transitions. [2022-12-13 02:10:50,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 181 transitions, 2164 flow [2022-12-13 02:10:50,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 181 transitions, 1996 flow, removed 84 selfloop flow, removed 3 redundant places. [2022-12-13 02:10:50,641 INFO L231 Difference]: Finished difference. Result has 77 places, 99 transitions, 1280 flow [2022-12-13 02:10:50,642 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1280, PETRI_PLACES=77, PETRI_TRANSITIONS=99} [2022-12-13 02:10:50,642 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2022-12-13 02:10:50,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:50,642 INFO L89 Accepts]: Start accepts. Operand has 77 places, 99 transitions, 1280 flow [2022-12-13 02:10:50,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:50,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:50,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 99 transitions, 1280 flow [2022-12-13 02:10:50,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 99 transitions, 1280 flow [2022-12-13 02:10:50,756 INFO L130 PetriNetUnfolder]: 411/1176 cut-off events. [2022-12-13 02:10:50,756 INFO L131 PetriNetUnfolder]: For 5629/5843 co-relation queries the response was YES. [2022-12-13 02:10:50,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 1176 events. 411/1176 cut-off events. For 5629/5843 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 8976 event pairs, 40 based on Foata normal form. 46/966 useless extension candidates. Maximal degree in co-relation 4452. Up to 363 conditions per place. [2022-12-13 02:10:50,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 99 transitions, 1280 flow [2022-12-13 02:10:50,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 998 [2022-12-13 02:10:50,771 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:50,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:10:50,772 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 1280 flow [2022-12-13 02:10:50,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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) [2022-12-13 02:10:50,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:50,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:50,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 02:10:50,773 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:50,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1255963899, now seen corresponding path program 3 times [2022-12-13 02:10:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:50,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022180031] [2022-12-13 02:10:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:50,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:51,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022180031] [2022-12-13 02:10:51,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022180031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:51,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:51,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:10:51,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295868124] [2022-12-13 02:10:51,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:51,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:10:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:51,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:10:51,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:10:51,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:10:51,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 99 transitions, 1280 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-12-13 02:10:51,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:51,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:10:51,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:51,871 INFO L130 PetriNetUnfolder]: 3541/5448 cut-off events. [2022-12-13 02:10:51,871 INFO L131 PetriNetUnfolder]: For 43324/43324 co-relation queries the response was YES. [2022-12-13 02:10:51,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32192 conditions, 5448 events. 3541/5448 cut-off events. For 43324/43324 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 29138 event pairs, 718 based on Foata normal form. 18/4534 useless extension candidates. Maximal degree in co-relation 21291. Up to 4031 conditions per place. [2022-12-13 02:10:51,902 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 115 selfloop transitions, 12 changer transitions 9/136 dead transitions. [2022-12-13 02:10:51,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 136 transitions, 1766 flow [2022-12-13 02:10:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:10:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:10:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-13 02:10:51,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-13 02:10:51,908 INFO L175 Difference]: Start difference. First operand has 77 places, 99 transitions, 1280 flow. Second operand 6 states and 72 transitions. [2022-12-13 02:10:51,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 136 transitions, 1766 flow [2022-12-13 02:10:51,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 136 transitions, 1703 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-13 02:10:51,990 INFO L231 Difference]: Finished difference. Result has 78 places, 95 transitions, 1177 flow [2022-12-13 02:10:51,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1177, PETRI_PLACES=78, PETRI_TRANSITIONS=95} [2022-12-13 02:10:51,991 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 02:10:51,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:51,991 INFO L89 Accepts]: Start accepts. Operand has 78 places, 95 transitions, 1177 flow [2022-12-13 02:10:51,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:51,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:51,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 95 transitions, 1177 flow [2022-12-13 02:10:51,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 95 transitions, 1177 flow [2022-12-13 02:10:52,134 INFO L130 PetriNetUnfolder]: 415/1154 cut-off events. [2022-12-13 02:10:52,135 INFO L131 PetriNetUnfolder]: For 5374/5538 co-relation queries the response was YES. [2022-12-13 02:10:52,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6016 conditions, 1154 events. 415/1154 cut-off events. For 5374/5538 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8535 event pairs, 43 based on Foata normal form. 42/956 useless extension candidates. Maximal degree in co-relation 4497. Up to 369 conditions per place. [2022-12-13 02:10:52,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 95 transitions, 1177 flow [2022-12-13 02:10:52,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 958 [2022-12-13 02:10:52,152 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:52,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 02:10:52,154 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 95 transitions, 1177 flow [2022-12-13 02:10:52,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-12-13 02:10:52,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:52,154 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:52,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 02:10:52,154 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:52,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1098926403, now seen corresponding path program 4 times [2022-12-13 02:10:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:52,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200103958] [2022-12-13 02:10:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:53,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200103958] [2022-12-13 02:10:53,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200103958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:53,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:53,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 02:10:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800953934] [2022-12-13 02:10:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:53,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:10:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:53,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:10:53,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:10:53,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:10:53,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 95 transitions, 1177 flow. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-12-13 02:10:53,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:53,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:10:53,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:54,112 INFO L130 PetriNetUnfolder]: 3845/5875 cut-off events. [2022-12-13 02:10:54,112 INFO L131 PetriNetUnfolder]: For 46165/46165 co-relation queries the response was YES. [2022-12-13 02:10:54,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34409 conditions, 5875 events. 3845/5875 cut-off events. For 46165/46165 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 31489 event pairs, 1126 based on Foata normal form. 16/4907 useless extension candidates. Maximal degree in co-relation 23060. Up to 5153 conditions per place. [2022-12-13 02:10:54,145 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 139 selfloop transitions, 23 changer transitions 2/164 dead transitions. [2022-12-13 02:10:54,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 164 transitions, 2083 flow [2022-12-13 02:10:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:10:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:10:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 02:10:54,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-13 02:10:54,146 INFO L175 Difference]: Start difference. First operand has 76 places, 95 transitions, 1177 flow. Second operand 7 states and 84 transitions. [2022-12-13 02:10:54,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 164 transitions, 2083 flow [2022-12-13 02:10:54,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 164 transitions, 2037 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 02:10:54,206 INFO L231 Difference]: Finished difference. Result has 82 places, 113 transitions, 1492 flow [2022-12-13 02:10:54,206 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1492, PETRI_PLACES=82, PETRI_TRANSITIONS=113} [2022-12-13 02:10:54,206 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2022-12-13 02:10:54,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:54,206 INFO L89 Accepts]: Start accepts. Operand has 82 places, 113 transitions, 1492 flow [2022-12-13 02:10:54,207 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:54,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:54,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 113 transitions, 1492 flow [2022-12-13 02:10:54,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 113 transitions, 1492 flow [2022-12-13 02:10:54,316 INFO L130 PetriNetUnfolder]: 460/1268 cut-off events. [2022-12-13 02:10:54,316 INFO L131 PetriNetUnfolder]: For 5939/6141 co-relation queries the response was YES. [2022-12-13 02:10:54,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6722 conditions, 1268 events. 460/1268 cut-off events. For 5939/6141 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9657 event pairs, 48 based on Foata normal form. 45/1052 useless extension candidates. Maximal degree in co-relation 5088. Up to 391 conditions per place. [2022-12-13 02:10:54,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 113 transitions, 1492 flow [2022-12-13 02:10:54,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 1114 [2022-12-13 02:10:54,333 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:54,333 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:10:54,334 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 113 transitions, 1492 flow [2022-12-13 02:10:54,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-12-13 02:10:54,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:54,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:54,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 02:10:54,334 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:54,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 172408587, now seen corresponding path program 5 times [2022-12-13 02:10:54,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:54,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325669898] [2022-12-13 02:10:54,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:54,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:54,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325669898] [2022-12-13 02:10:54,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325669898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:54,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:54,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:10:54,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131439338] [2022-12-13 02:10:54,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:54,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:10:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:54,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:10:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:10:54,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:10:54,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 113 transitions, 1492 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:54,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:54,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:10:54,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:55,697 INFO L130 PetriNetUnfolder]: 4473/6908 cut-off events. [2022-12-13 02:10:55,697 INFO L131 PetriNetUnfolder]: For 55135/55135 co-relation queries the response was YES. [2022-12-13 02:10:55,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41513 conditions, 6908 events. 4473/6908 cut-off events. For 55135/55135 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39184 event pairs, 850 based on Foata normal form. 60/5810 useless extension candidates. Maximal degree in co-relation 28880. Up to 4401 conditions per place. [2022-12-13 02:10:55,731 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 146 selfloop transitions, 24 changer transitions 2/172 dead transitions. [2022-12-13 02:10:55,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 172 transitions, 2299 flow [2022-12-13 02:10:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:10:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:10:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-13 02:10:55,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2022-12-13 02:10:55,732 INFO L175 Difference]: Start difference. First operand has 82 places, 113 transitions, 1492 flow. Second operand 6 states and 79 transitions. [2022-12-13 02:10:55,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 172 transitions, 2299 flow [2022-12-13 02:10:55,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 172 transitions, 2282 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 02:10:55,867 INFO L231 Difference]: Finished difference. Result has 89 places, 119 transitions, 1679 flow [2022-12-13 02:10:55,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1679, PETRI_PLACES=89, PETRI_TRANSITIONS=119} [2022-12-13 02:10:55,868 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 57 predicate places. [2022-12-13 02:10:55,868 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:55,869 INFO L89 Accepts]: Start accepts. Operand has 89 places, 119 transitions, 1679 flow [2022-12-13 02:10:55,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:55,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:55,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 119 transitions, 1679 flow [2022-12-13 02:10:55,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 119 transitions, 1679 flow [2022-12-13 02:10:56,021 INFO L130 PetriNetUnfolder]: 503/1436 cut-off events. [2022-12-13 02:10:56,021 INFO L131 PetriNetUnfolder]: For 9222/9527 co-relation queries the response was YES. [2022-12-13 02:10:56,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8239 conditions, 1436 events. 503/1436 cut-off events. For 9222/9527 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 11636 event pairs, 63 based on Foata normal form. 54/1195 useless extension candidates. Maximal degree in co-relation 6432. Up to 447 conditions per place. [2022-12-13 02:10:56,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 119 transitions, 1679 flow [2022-12-13 02:10:56,046 INFO L226 LiptonReduction]: Number of co-enabled transitions 1204 [2022-12-13 02:10:56,047 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:56,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-13 02:10:56,048 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 119 transitions, 1679 flow [2022-12-13 02:10:56,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:56,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:56,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:56,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 02:10:56,049 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:56,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1078598459, now seen corresponding path program 6 times [2022-12-13 02:10:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:56,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853470975] [2022-12-13 02:10:56,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:56,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853470975] [2022-12-13 02:10:56,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853470975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:56,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:56,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:10:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358223374] [2022-12-13 02:10:56,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:56,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:10:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:56,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:10:56,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:10:56,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:10:56,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 119 transitions, 1679 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:56,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:56,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:10:56,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:57,548 INFO L130 PetriNetUnfolder]: 4437/6790 cut-off events. [2022-12-13 02:10:57,548 INFO L131 PetriNetUnfolder]: For 65226/65226 co-relation queries the response was YES. [2022-12-13 02:10:57,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43738 conditions, 6790 events. 4437/6790 cut-off events. For 65226/65226 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 37877 event pairs, 534 based on Foata normal form. 64/5715 useless extension candidates. Maximal degree in co-relation 30892. Up to 3159 conditions per place. [2022-12-13 02:10:57,585 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 148 selfloop transitions, 55 changer transitions 4/207 dead transitions. [2022-12-13 02:10:57,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 207 transitions, 2840 flow [2022-12-13 02:10:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:10:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:10:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-13 02:10:57,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2022-12-13 02:10:57,586 INFO L175 Difference]: Start difference. First operand has 89 places, 119 transitions, 1679 flow. Second operand 8 states and 97 transitions. [2022-12-13 02:10:57,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 207 transitions, 2840 flow [2022-12-13 02:10:57,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 207 transitions, 2804 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 02:10:57,721 INFO L231 Difference]: Finished difference. Result has 95 places, 127 transitions, 1955 flow [2022-12-13 02:10:57,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1955, PETRI_PLACES=95, PETRI_TRANSITIONS=127} [2022-12-13 02:10:57,722 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2022-12-13 02:10:57,722 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:57,722 INFO L89 Accepts]: Start accepts. Operand has 95 places, 127 transitions, 1955 flow [2022-12-13 02:10:57,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:57,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:57,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 127 transitions, 1955 flow [2022-12-13 02:10:57,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 127 transitions, 1955 flow [2022-12-13 02:10:57,846 INFO L130 PetriNetUnfolder]: 530/1458 cut-off events. [2022-12-13 02:10:57,846 INFO L131 PetriNetUnfolder]: For 10814/11008 co-relation queries the response was YES. [2022-12-13 02:10:57,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8915 conditions, 1458 events. 530/1458 cut-off events. For 10814/11008 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 11599 event pairs, 68 based on Foata normal form. 45/1205 useless extension candidates. Maximal degree in co-relation 7061. Up to 481 conditions per place. [2022-12-13 02:10:57,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 127 transitions, 1955 flow [2022-12-13 02:10:57,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 1282 [2022-12-13 02:10:57,862 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:57,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:10:57,863 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 127 transitions, 1955 flow [2022-12-13 02:10:57,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:57,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:57,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:57,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 02:10:57,864 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:57,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1079489095, now seen corresponding path program 1 times [2022-12-13 02:10:57,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:57,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822213184] [2022-12-13 02:10:57,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:57,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:58,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:58,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822213184] [2022-12-13 02:10:58,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822213184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:10:58,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:10:58,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:10:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280268015] [2022-12-13 02:10:58,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:10:58,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:10:58,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:58,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:10:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:10:58,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:10:58,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 127 transitions, 1955 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:58,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:58,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:10:58,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:59,421 INFO L130 PetriNetUnfolder]: 4730/7237 cut-off events. [2022-12-13 02:10:59,421 INFO L131 PetriNetUnfolder]: For 83504/83504 co-relation queries the response was YES. [2022-12-13 02:10:59,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48616 conditions, 7237 events. 4730/7237 cut-off events. For 83504/83504 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 40487 event pairs, 894 based on Foata normal form. 76/6108 useless extension candidates. Maximal degree in co-relation 35301. Up to 4027 conditions per place. [2022-12-13 02:10:59,460 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 135 selfloop transitions, 56 changer transitions 0/191 dead transitions. [2022-12-13 02:10:59,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 191 transitions, 2881 flow [2022-12-13 02:10:59,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:10:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:10:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-13 02:10:59,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2022-12-13 02:10:59,461 INFO L175 Difference]: Start difference. First operand has 95 places, 127 transitions, 1955 flow. Second operand 6 states and 77 transitions. [2022-12-13 02:10:59,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 191 transitions, 2881 flow [2022-12-13 02:10:59,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 191 transitions, 2798 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 02:10:59,658 INFO L231 Difference]: Finished difference. Result has 101 places, 143 transitions, 2309 flow [2022-12-13 02:10:59,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1876, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2309, PETRI_PLACES=101, PETRI_TRANSITIONS=143} [2022-12-13 02:10:59,658 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2022-12-13 02:10:59,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:59,658 INFO L89 Accepts]: Start accepts. Operand has 101 places, 143 transitions, 2309 flow [2022-12-13 02:10:59,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:59,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:59,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 143 transitions, 2309 flow [2022-12-13 02:10:59,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 143 transitions, 2309 flow [2022-12-13 02:10:59,835 INFO L130 PetriNetUnfolder]: 643/1657 cut-off events. [2022-12-13 02:10:59,835 INFO L131 PetriNetUnfolder]: For 15352/15618 co-relation queries the response was YES. [2022-12-13 02:10:59,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10966 conditions, 1657 events. 643/1657 cut-off events. For 15352/15618 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12878 event pairs, 82 based on Foata normal form. 55/1380 useless extension candidates. Maximal degree in co-relation 8856. Up to 577 conditions per place. [2022-12-13 02:10:59,853 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 143 transitions, 2309 flow [2022-12-13 02:10:59,853 INFO L226 LiptonReduction]: Number of co-enabled transitions 1366 [2022-12-13 02:10:59,854 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:10:59,855 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-13 02:10:59,855 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 143 transitions, 2309 flow [2022-12-13 02:10:59,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-12-13 02:10:59,855 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:59,855 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:59,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 02:10:59,856 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:10:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1052239224, now seen corresponding path program 1 times [2022-12-13 02:10:59,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:59,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881813007] [2022-12-13 02:10:59,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:00,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881813007] [2022-12-13 02:11:00,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881813007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:00,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:00,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:11:00,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030236394] [2022-12-13 02:11:00,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:00,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:11:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:11:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:11:00,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:11:00,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 143 transitions, 2309 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:11:00,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:00,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:11:00,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:01,479 INFO L130 PetriNetUnfolder]: 5174/7905 cut-off events. [2022-12-13 02:11:01,479 INFO L131 PetriNetUnfolder]: For 107302/107302 co-relation queries the response was YES. [2022-12-13 02:11:01,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56505 conditions, 7905 events. 5174/7905 cut-off events. For 107302/107302 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 44942 event pairs, 990 based on Foata normal form. 16/6610 useless extension candidates. Maximal degree in co-relation 44172. Up to 6558 conditions per place. [2022-12-13 02:11:01,528 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 157 selfloop transitions, 39 changer transitions 0/196 dead transitions. [2022-12-13 02:11:01,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 196 transitions, 3213 flow [2022-12-13 02:11:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 02:11:01,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2022-12-13 02:11:01,529 INFO L175 Difference]: Start difference. First operand has 101 places, 143 transitions, 2309 flow. Second operand 6 states and 76 transitions. [2022-12-13 02:11:01,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 196 transitions, 3213 flow [2022-12-13 02:11:01,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 196 transitions, 3109 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 02:11:01,787 INFO L231 Difference]: Finished difference. Result has 106 places, 151 transitions, 2486 flow [2022-12-13 02:11:01,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2227, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2486, PETRI_PLACES=106, PETRI_TRANSITIONS=151} [2022-12-13 02:11:01,788 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 74 predicate places. [2022-12-13 02:11:01,788 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:01,788 INFO L89 Accepts]: Start accepts. Operand has 106 places, 151 transitions, 2486 flow [2022-12-13 02:11:01,789 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:01,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:01,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 151 transitions, 2486 flow [2022-12-13 02:11:01,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 151 transitions, 2486 flow [2022-12-13 02:11:01,980 INFO L130 PetriNetUnfolder]: 681/1801 cut-off events. [2022-12-13 02:11:01,980 INFO L131 PetriNetUnfolder]: For 16466/16715 co-relation queries the response was YES. [2022-12-13 02:11:01,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11843 conditions, 1801 events. 681/1801 cut-off events. For 16466/16715 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 14528 event pairs, 80 based on Foata normal form. 57/1499 useless extension candidates. Maximal degree in co-relation 9891. Up to 635 conditions per place. [2022-12-13 02:11:02,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 151 transitions, 2486 flow [2022-12-13 02:11:02,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 1470 [2022-12-13 02:11:02,001 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:02,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-13 02:11:02,002 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 151 transitions, 2486 flow [2022-12-13 02:11:02,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:11:02,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:02,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:02,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 02:11:02,002 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:02,003 INFO L85 PathProgramCache]: Analyzing trace with hash 799620640, now seen corresponding path program 2 times [2022-12-13 02:11:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:02,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146235145] [2022-12-13 02:11:02,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:02,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:02,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:02,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146235145] [2022-12-13 02:11:02,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146235145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:02,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:02,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:11:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245897556] [2022-12-13 02:11:02,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:02,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:11:02,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:02,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:11:02,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:11:02,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:11:02,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 151 transitions, 2486 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:11:02,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:02,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:11:02,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:03,844 INFO L130 PetriNetUnfolder]: 5172/7881 cut-off events. [2022-12-13 02:11:03,844 INFO L131 PetriNetUnfolder]: For 105145/105145 co-relation queries the response was YES. [2022-12-13 02:11:03,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56982 conditions, 7881 events. 5172/7881 cut-off events. For 105145/105145 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 44567 event pairs, 1050 based on Foata normal form. 16/6588 useless extension candidates. Maximal degree in co-relation 44581. Up to 6862 conditions per place. [2022-12-13 02:11:03,886 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 137 selfloop transitions, 46 changer transitions 1/184 dead transitions. [2022-12-13 02:11:03,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 184 transitions, 3076 flow [2022-12-13 02:11:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 02:11:03,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2022-12-13 02:11:03,892 INFO L175 Difference]: Start difference. First operand has 106 places, 151 transitions, 2486 flow. Second operand 6 states and 71 transitions. [2022-12-13 02:11:03,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 184 transitions, 3076 flow [2022-12-13 02:11:04,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 184 transitions, 2986 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-13 02:11:04,184 INFO L231 Difference]: Finished difference. Result has 109 places, 152 transitions, 2543 flow [2022-12-13 02:11:04,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2404, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2543, PETRI_PLACES=109, PETRI_TRANSITIONS=152} [2022-12-13 02:11:04,184 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2022-12-13 02:11:04,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:04,184 INFO L89 Accepts]: Start accepts. Operand has 109 places, 152 transitions, 2543 flow [2022-12-13 02:11:04,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:04,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:04,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 152 transitions, 2543 flow [2022-12-13 02:11:04,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 152 transitions, 2543 flow [2022-12-13 02:11:04,347 INFO L130 PetriNetUnfolder]: 685/1804 cut-off events. [2022-12-13 02:11:04,347 INFO L131 PetriNetUnfolder]: For 16080/16319 co-relation queries the response was YES. [2022-12-13 02:11:04,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11717 conditions, 1804 events. 685/1804 cut-off events. For 16080/16319 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14535 event pairs, 82 based on Foata normal form. 56/1505 useless extension candidates. Maximal degree in co-relation 9764. Up to 641 conditions per place. [2022-12-13 02:11:04,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 152 transitions, 2543 flow [2022-12-13 02:11:04,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 1482 [2022-12-13 02:11:04,369 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:04,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-13 02:11:04,370 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 152 transitions, 2543 flow [2022-12-13 02:11:04,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:11:04,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:04,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:04,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 02:11:04,372 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash 145107536, now seen corresponding path program 1 times [2022-12-13 02:11:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:04,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862147329] [2022-12-13 02:11:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:04,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:04,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:04,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862147329] [2022-12-13 02:11:04,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862147329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:11:04,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673988900] [2022-12-13 02:11:04,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:04,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:11:04,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:11:04,486 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) [2022-12-13 02:11:04,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 02:11:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:04,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 02:11:04,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:11:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:04,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:11:04,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673988900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:04,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:11:04,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 02:11:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936398434] [2022-12-13 02:11:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:04,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:11:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:11:04,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:11:04,748 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:11:04,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 152 transitions, 2543 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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) [2022-12-13 02:11:04,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:04,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:11:04,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:05,634 INFO L130 PetriNetUnfolder]: 4194/6395 cut-off events. [2022-12-13 02:11:05,634 INFO L131 PetriNetUnfolder]: For 97389/97389 co-relation queries the response was YES. [2022-12-13 02:11:05,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46451 conditions, 6395 events. 4194/6395 cut-off events. For 97389/97389 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 34836 event pairs, 1377 based on Foata normal form. 200/5502 useless extension candidates. Maximal degree in co-relation 38207. Up to 3636 conditions per place. [2022-12-13 02:11:05,668 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 147 selfloop transitions, 3 changer transitions 62/212 dead transitions. [2022-12-13 02:11:05,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 212 transitions, 3668 flow [2022-12-13 02:11:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:11:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:11:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-13 02:11:05,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2022-12-13 02:11:05,669 INFO L175 Difference]: Start difference. First operand has 107 places, 152 transitions, 2543 flow. Second operand 4 states and 64 transitions. [2022-12-13 02:11:05,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 212 transitions, 3668 flow [2022-12-13 02:11:05,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 212 transitions, 3616 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 02:11:05,844 INFO L231 Difference]: Finished difference. Result has 108 places, 112 transitions, 1658 flow [2022-12-13 02:11:05,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2399, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1658, PETRI_PLACES=108, PETRI_TRANSITIONS=112} [2022-12-13 02:11:05,844 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 76 predicate places. [2022-12-13 02:11:05,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:05,844 INFO L89 Accepts]: Start accepts. Operand has 108 places, 112 transitions, 1658 flow [2022-12-13 02:11:05,846 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:05,846 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:05,846 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 112 transitions, 1658 flow [2022-12-13 02:11:05,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 1658 flow [2022-12-13 02:11:05,941 INFO L130 PetriNetUnfolder]: 408/1057 cut-off events. [2022-12-13 02:11:05,942 INFO L131 PetriNetUnfolder]: For 8574/8662 co-relation queries the response was YES. [2022-12-13 02:11:05,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 1057 events. 408/1057 cut-off events. For 8574/8662 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7429 event pairs, 55 based on Foata normal form. 19/864 useless extension candidates. Maximal degree in co-relation 6217. Up to 424 conditions per place. [2022-12-13 02:11:05,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 112 transitions, 1658 flow [2022-12-13 02:11:05,952 INFO L226 LiptonReduction]: Number of co-enabled transitions 956 [2022-12-13 02:11:05,952 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:05,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 02:11:05,953 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 112 transitions, 1658 flow [2022-12-13 02:11:05,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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) [2022-12-13 02:11:05,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:05,953 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:05,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 02:11:06,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 02:11:06,155 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:06,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1672979411, now seen corresponding path program 1 times [2022-12-13 02:11:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:06,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654266391] [2022-12-13 02:11:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:07,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654266391] [2022-12-13 02:11:07,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654266391] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:11:07,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295079426] [2022-12-13 02:11:07,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:07,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:11:07,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:11:07,280 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) [2022-12-13 02:11:07,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 02:11:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:07,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 02:11:07,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:11:07,500 INFO L350 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 23 treesize of output 7 [2022-12-13 02:11:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:11:07,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:11:07,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295079426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:07,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:11:07,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2022-12-13 02:11:07,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091614286] [2022-12-13 02:11:07,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:07,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:11:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:07,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:11:07,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:11:07,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 02:11:07,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 112 transitions, 1658 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-12-13 02:11:07,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:07,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 02:11:07,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:08,092 INFO L130 PetriNetUnfolder]: 3251/4985 cut-off events. [2022-12-13 02:11:08,092 INFO L131 PetriNetUnfolder]: For 60266/60266 co-relation queries the response was YES. [2022-12-13 02:11:08,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34117 conditions, 4985 events. 3251/4985 cut-off events. For 60266/60266 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 26434 event pairs, 834 based on Foata normal form. 76/4193 useless extension candidates. Maximal degree in co-relation 32895. Up to 3530 conditions per place. [2022-12-13 02:11:08,124 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 119 selfloop transitions, 31 changer transitions 0/150 dead transitions. [2022-12-13 02:11:08,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 150 transitions, 2344 flow [2022-12-13 02:11:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:11:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:11:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-13 02:11:08,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-13 02:11:08,127 INFO L175 Difference]: Start difference. First operand has 103 places, 112 transitions, 1658 flow. Second operand 5 states and 58 transitions. [2022-12-13 02:11:08,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 150 transitions, 2344 flow [2022-12-13 02:11:08,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 150 transitions, 2241 flow, removed 34 selfloop flow, removed 9 redundant places. [2022-12-13 02:11:08,235 INFO L231 Difference]: Finished difference. Result has 100 places, 121 transitions, 1832 flow [2022-12-13 02:11:08,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1832, PETRI_PLACES=100, PETRI_TRANSITIONS=121} [2022-12-13 02:11:08,236 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2022-12-13 02:11:08,236 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:08,236 INFO L89 Accepts]: Start accepts. Operand has 100 places, 121 transitions, 1832 flow [2022-12-13 02:11:08,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:08,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:08,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 121 transitions, 1832 flow [2022-12-13 02:11:08,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 121 transitions, 1832 flow [2022-12-13 02:11:08,332 INFO L130 PetriNetUnfolder]: 451/1173 cut-off events. [2022-12-13 02:11:08,332 INFO L131 PetriNetUnfolder]: For 8646/8728 co-relation queries the response was YES. [2022-12-13 02:11:08,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7184 conditions, 1173 events. 451/1173 cut-off events. For 8646/8728 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 8613 event pairs, 63 based on Foata normal form. 32/962 useless extension candidates. Maximal degree in co-relation 6429. Up to 476 conditions per place. [2022-12-13 02:11:08,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 121 transitions, 1832 flow [2022-12-13 02:11:08,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 1054 [2022-12-13 02:11:08,355 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:08,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:11:08,356 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 121 transitions, 1832 flow [2022-12-13 02:11:08,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-12-13 02:11:08,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:08,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:08,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 02:11:08,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 02:11:08,561 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1104320029, now seen corresponding path program 1 times [2022-12-13 02:11:08,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:08,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854808777] [2022-12-13 02:11:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:09,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854808777] [2022-12-13 02:11:09,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854808777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:09,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:09,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:11:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84435774] [2022-12-13 02:11:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:09,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:11:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:11:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:11:09,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 02:11:09,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 121 transitions, 1832 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:11:09,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:09,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 02:11:09,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:10,008 INFO L130 PetriNetUnfolder]: 3415/5247 cut-off events. [2022-12-13 02:11:10,008 INFO L131 PetriNetUnfolder]: For 55586/55586 co-relation queries the response was YES. [2022-12-13 02:11:10,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35432 conditions, 5247 events. 3415/5247 cut-off events. For 55586/55586 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 28317 event pairs, 546 based on Foata normal form. 28/4365 useless extension candidates. Maximal degree in co-relation 31243. Up to 2917 conditions per place. [2022-12-13 02:11:10,041 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 117 selfloop transitions, 57 changer transitions 0/174 dead transitions. [2022-12-13 02:11:10,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 174 transitions, 2578 flow [2022-12-13 02:11:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:11:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:11:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-12-13 02:11:10,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 02:11:10,042 INFO L175 Difference]: Start difference. First operand has 100 places, 121 transitions, 1832 flow. Second operand 8 states and 85 transitions. [2022-12-13 02:11:10,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 174 transitions, 2578 flow [2022-12-13 02:11:10,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 174 transitions, 2527 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 02:11:10,169 INFO L231 Difference]: Finished difference. Result has 109 places, 128 transitions, 2127 flow [2022-12-13 02:11:10,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2127, PETRI_PLACES=109, PETRI_TRANSITIONS=128} [2022-12-13 02:11:10,169 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2022-12-13 02:11:10,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:10,170 INFO L89 Accepts]: Start accepts. Operand has 109 places, 128 transitions, 2127 flow [2022-12-13 02:11:10,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:10,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:10,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 128 transitions, 2127 flow [2022-12-13 02:11:10,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 128 transitions, 2127 flow [2022-12-13 02:11:10,278 INFO L130 PetriNetUnfolder]: 469/1249 cut-off events. [2022-12-13 02:11:10,279 INFO L131 PetriNetUnfolder]: For 11723/11812 co-relation queries the response was YES. [2022-12-13 02:11:10,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8026 conditions, 1249 events. 469/1249 cut-off events. For 11723/11812 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9438 event pairs, 69 based on Foata normal form. 33/1029 useless extension candidates. Maximal degree in co-relation 7194. Up to 508 conditions per place. [2022-12-13 02:11:10,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 128 transitions, 2127 flow [2022-12-13 02:11:10,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 1116 [2022-12-13 02:11:18,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:11:18,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8565 [2022-12-13 02:11:18,734 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 2168 flow [2022-12-13 02:11:18,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:11:18,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:18,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:18,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 02:11:18,734 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:18,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1263095857, now seen corresponding path program 1 times [2022-12-13 02:11:18,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:18,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888317681] [2022-12-13 02:11:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:18,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:19,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:19,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888317681] [2022-12-13 02:11:19,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888317681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:19,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:19,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 02:11:19,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684284595] [2022-12-13 02:11:19,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:19,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:11:19,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:19,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:11:19,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:11:19,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 02:11:19,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 128 transitions, 2168 flow. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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) [2022-12-13 02:11:19,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:19,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 02:11:19,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:21,052 INFO L130 PetriNetUnfolder]: 4196/6451 cut-off events. [2022-12-13 02:11:21,052 INFO L131 PetriNetUnfolder]: For 88842/88842 co-relation queries the response was YES. [2022-12-13 02:11:21,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45775 conditions, 6451 events. 4196/6451 cut-off events. For 88842/88842 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 36255 event pairs, 1135 based on Foata normal form. 32/5320 useless extension candidates. Maximal degree in co-relation 40647. Up to 4731 conditions per place. [2022-12-13 02:11:21,099 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 136 selfloop transitions, 46 changer transitions 36/218 dead transitions. [2022-12-13 02:11:21,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 218 transitions, 3636 flow [2022-12-13 02:11:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:11:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:11:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-12-13 02:11:21,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2022-12-13 02:11:21,104 INFO L175 Difference]: Start difference. First operand has 109 places, 128 transitions, 2168 flow. Second operand 8 states and 94 transitions. [2022-12-13 02:11:21,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 218 transitions, 3636 flow [2022-12-13 02:11:21,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 218 transitions, 3481 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-13 02:11:21,258 INFO L231 Difference]: Finished difference. Result has 116 places, 153 transitions, 2704 flow [2022-12-13 02:11:21,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2704, PETRI_PLACES=116, PETRI_TRANSITIONS=153} [2022-12-13 02:11:21,258 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 84 predicate places. [2022-12-13 02:11:21,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:21,258 INFO L89 Accepts]: Start accepts. Operand has 116 places, 153 transitions, 2704 flow [2022-12-13 02:11:21,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:21,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:21,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 153 transitions, 2704 flow [2022-12-13 02:11:21,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 153 transitions, 2704 flow [2022-12-13 02:11:21,419 INFO L130 PetriNetUnfolder]: 661/1542 cut-off events. [2022-12-13 02:11:21,419 INFO L131 PetriNetUnfolder]: For 19403/19537 co-relation queries the response was YES. [2022-12-13 02:11:21,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 1542 events. 661/1542 cut-off events. For 19403/19537 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11179 event pairs, 72 based on Foata normal form. 47/1275 useless extension candidates. Maximal degree in co-relation 9500. Up to 556 conditions per place. [2022-12-13 02:11:21,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 153 transitions, 2704 flow [2022-12-13 02:11:21,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 1274 [2022-12-13 02:11:21,437 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [931] $Ultimate##0-->L49-5: Formula: (and (not (= (ite (and (< v_~q1_back~0_199 v_~n1~0_121) (<= 0 v_~q1_back~0_199)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_287| v_~q1~0.base_118) (+ (* v_~q1_back~0_199 4) v_~q1~0.offset_118)) 1) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (= |v_thread1Thread1of1ForFork1_~i~0#1_47| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|) (= (+ v_~q1_back~0_199 1) v_~q1_back~0_198) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| 0)) (< |v_thread1Thread1of1ForFork1_~i~0#1_47| (+ 1 v_~N~0_95)) (= (+ v_~x~0_102 v_~C~0_133) v_~x~0_101)) InVars {~q1~0.offset=v_~q1~0.offset_118, ~C~0=v_~C~0_133, ~q1_back~0=v_~q1_back~0_199, ~n1~0=v_~n1~0_121, ~q1~0.base=v_~q1~0.base_118, #memory_int=|v_#memory_int_287|, ~N~0=v_~N~0_95, ~x~0=v_~x~0_102} OutVars{~q1~0.offset=v_~q1~0.offset_118, ~C~0=v_~C~0_133, ~n1~0=v_~n1~0_121, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_23|, ~N~0=v_~N~0_95, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_25|, ~q1_back~0=v_~q1_back~0_198, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_23|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_47|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~q1~0.base=v_~q1~0.base_118, #memory_int=|v_#memory_int_287|, ~x~0=v_~x~0_101, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [882] L127-3-->L128-3: Formula: (and (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_#pthreadsForks_53| |v_ULTIMATE.start_main_#t~pre22#1_23|) (= (store |v_#memory_int_192| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_192| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre22#1_23|)) |v_#memory_int_191|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_192|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_31|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_191|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-13 02:11:21,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:11:21,961 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:11:21,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 704 [2022-12-13 02:11:21,962 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 153 transitions, 2750 flow [2022-12-13 02:11:21,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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) [2022-12-13 02:11:21,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:21,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:21,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 02:11:21,962 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:21,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash -811203419, now seen corresponding path program 2 times [2022-12-13 02:11:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:21,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497606991] [2022-12-13 02:11:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497606991] [2022-12-13 02:11:23,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497606991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:23,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:23,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 02:11:23,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461148827] [2022-12-13 02:11:23,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:23,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:11:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:23,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:11:23,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:11:23,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:11:23,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 153 transitions, 2750 flow. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-12-13 02:11:23,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:23,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:11:23,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:24,468 INFO L130 PetriNetUnfolder]: 3944/6001 cut-off events. [2022-12-13 02:11:24,468 INFO L131 PetriNetUnfolder]: For 96295/96295 co-relation queries the response was YES. [2022-12-13 02:11:24,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46080 conditions, 6001 events. 3944/6001 cut-off events. For 96295/96295 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 32102 event pairs, 1468 based on Foata normal form. 16/4955 useless extension candidates. Maximal degree in co-relation 40681. Up to 5733 conditions per place. [2022-12-13 02:11:24,510 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 156 selfloop transitions, 5 changer transitions 34/195 dead transitions. [2022-12-13 02:11:24,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 195 transitions, 3482 flow [2022-12-13 02:11:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:11:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:11:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 02:11:24,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31512605042016806 [2022-12-13 02:11:24,511 INFO L175 Difference]: Start difference. First operand has 113 places, 153 transitions, 2750 flow. Second operand 7 states and 75 transitions. [2022-12-13 02:11:24,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 195 transitions, 3482 flow [2022-12-13 02:11:24,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 195 transitions, 3343 flow, removed 48 selfloop flow, removed 2 redundant places. [2022-12-13 02:11:24,750 INFO L231 Difference]: Finished difference. Result has 118 places, 149 transitions, 2600 flow [2022-12-13 02:11:24,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2628, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2600, PETRI_PLACES=118, PETRI_TRANSITIONS=149} [2022-12-13 02:11:24,750 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2022-12-13 02:11:24,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:24,751 INFO L89 Accepts]: Start accepts. Operand has 118 places, 149 transitions, 2600 flow [2022-12-13 02:11:24,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:24,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:24,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 149 transitions, 2600 flow [2022-12-13 02:11:24,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 149 transitions, 2600 flow [2022-12-13 02:11:24,897 INFO L130 PetriNetUnfolder]: 638/1527 cut-off events. [2022-12-13 02:11:24,898 INFO L131 PetriNetUnfolder]: For 18585/18712 co-relation queries the response was YES. [2022-12-13 02:11:24,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10429 conditions, 1527 events. 638/1527 cut-off events. For 18585/18712 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11099 event pairs, 86 based on Foata normal form. 40/1271 useless extension candidates. Maximal degree in co-relation 10154. Up to 548 conditions per place. [2022-12-13 02:11:24,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 149 transitions, 2600 flow [2022-12-13 02:11:24,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 1238 [2022-12-13 02:11:24,915 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:24,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 02:11:24,916 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 149 transitions, 2600 flow [2022-12-13 02:11:24,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-12-13 02:11:24,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:24,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:24,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 02:11:24,916 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash 823243363, now seen corresponding path program 1 times [2022-12-13 02:11:24,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:24,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999760576] [2022-12-13 02:11:24,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:24,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:25,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999760576] [2022-12-13 02:11:25,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999760576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:25,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:25,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:11:25,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980284616] [2022-12-13 02:11:25,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:25,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:11:25,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:25,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:11:25,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:11:25,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:11:25,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 149 transitions, 2600 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-12-13 02:11:25,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:25,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:11:25,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:26,171 INFO L130 PetriNetUnfolder]: 3861/5846 cut-off events. [2022-12-13 02:11:26,171 INFO L131 PetriNetUnfolder]: For 87263/87263 co-relation queries the response was YES. [2022-12-13 02:11:26,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43869 conditions, 5846 events. 3861/5846 cut-off events. For 87263/87263 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30855 event pairs, 1139 based on Foata normal form. 2/4816 useless extension candidates. Maximal degree in co-relation 42647. Up to 5729 conditions per place. [2022-12-13 02:11:26,214 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 136 selfloop transitions, 25 changer transitions 2/163 dead transitions. [2022-12-13 02:11:26,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 163 transitions, 2986 flow [2022-12-13 02:11:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:11:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:11:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-13 02:11:26,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32941176470588235 [2022-12-13 02:11:26,215 INFO L175 Difference]: Start difference. First operand has 114 places, 149 transitions, 2600 flow. Second operand 5 states and 56 transitions. [2022-12-13 02:11:26,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 163 transitions, 2986 flow [2022-12-13 02:11:26,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 163 transitions, 2907 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-13 02:11:26,411 INFO L231 Difference]: Finished difference. Result has 113 places, 148 transitions, 2554 flow [2022-12-13 02:11:26,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2523, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2554, PETRI_PLACES=113, PETRI_TRANSITIONS=148} [2022-12-13 02:11:26,412 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 81 predicate places. [2022-12-13 02:11:26,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:26,412 INFO L89 Accepts]: Start accepts. Operand has 113 places, 148 transitions, 2554 flow [2022-12-13 02:11:26,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:26,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:26,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 148 transitions, 2554 flow [2022-12-13 02:11:26,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 148 transitions, 2554 flow [2022-12-13 02:11:26,566 INFO L130 PetriNetUnfolder]: 631/1512 cut-off events. [2022-12-13 02:11:26,566 INFO L131 PetriNetUnfolder]: For 17170/17297 co-relation queries the response was YES. [2022-12-13 02:11:26,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9924 conditions, 1512 events. 631/1512 cut-off events. For 17170/17297 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10963 event pairs, 86 based on Foata normal form. 40/1259 useless extension candidates. Maximal degree in co-relation 8977. Up to 542 conditions per place. [2022-12-13 02:11:26,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 148 transitions, 2554 flow [2022-12-13 02:11:26,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 1236 [2022-12-13 02:11:26,587 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:26,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 02:11:26,587 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 148 transitions, 2554 flow [2022-12-13 02:11:26,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-12-13 02:11:26,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:26,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:26,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 02:11:26,588 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1127281499, now seen corresponding path program 1 times [2022-12-13 02:11:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:26,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479121921] [2022-12-13 02:11:26,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:27,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:27,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479121921] [2022-12-13 02:11:27,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479121921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:27,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:27,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:11:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235063190] [2022-12-13 02:11:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:27,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:11:27,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:11:27,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:11:27,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 02:11:27,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 148 transitions, 2554 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-13 02:11:27,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:27,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 02:11:27,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:28,218 INFO L130 PetriNetUnfolder]: 3926/5950 cut-off events. [2022-12-13 02:11:28,219 INFO L131 PetriNetUnfolder]: For 85212/85212 co-relation queries the response was YES. [2022-12-13 02:11:28,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43046 conditions, 5950 events. 3926/5950 cut-off events. For 85212/85212 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 31661 event pairs, 1389 based on Foata normal form. 16/4914 useless extension candidates. Maximal degree in co-relation 38401. Up to 5736 conditions per place. [2022-12-13 02:11:28,252 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 152 selfloop transitions, 15 changer transitions 18/185 dead transitions. [2022-12-13 02:11:28,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 185 transitions, 3195 flow [2022-12-13 02:11:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-13 02:11:28,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2022-12-13 02:11:28,253 INFO L175 Difference]: Start difference. First operand has 112 places, 148 transitions, 2554 flow. Second operand 6 states and 70 transitions. [2022-12-13 02:11:28,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 185 transitions, 3195 flow [2022-12-13 02:11:28,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 185 transitions, 3137 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 02:11:28,384 INFO L231 Difference]: Finished difference. Result has 117 places, 156 transitions, 2665 flow [2022-12-13 02:11:28,384 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2500, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2665, PETRI_PLACES=117, PETRI_TRANSITIONS=156} [2022-12-13 02:11:28,384 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 85 predicate places. [2022-12-13 02:11:28,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:28,385 INFO L89 Accepts]: Start accepts. Operand has 117 places, 156 transitions, 2665 flow [2022-12-13 02:11:28,386 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:28,386 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:28,386 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 156 transitions, 2665 flow [2022-12-13 02:11:28,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 156 transitions, 2665 flow [2022-12-13 02:11:28,523 INFO L130 PetriNetUnfolder]: 644/1557 cut-off events. [2022-12-13 02:11:28,523 INFO L131 PetriNetUnfolder]: For 17766/17904 co-relation queries the response was YES. [2022-12-13 02:11:28,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10265 conditions, 1557 events. 644/1557 cut-off events. For 17766/17904 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11436 event pairs, 82 based on Foata normal form. 51/1309 useless extension candidates. Maximal degree in co-relation 9316. Up to 559 conditions per place. [2022-12-13 02:11:28,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 156 transitions, 2665 flow [2022-12-13 02:11:28,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 1284 [2022-12-13 02:11:28,540 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:28,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 02:11:28,541 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 156 transitions, 2665 flow [2022-12-13 02:11:28,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-13 02:11:28,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:28,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:28,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 02:11:28,542 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:28,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1667772633, now seen corresponding path program 2 times [2022-12-13 02:11:28,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:28,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157628210] [2022-12-13 02:11:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:28,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:29,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157628210] [2022-12-13 02:11:29,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157628210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:29,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:29,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:11:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800260442] [2022-12-13 02:11:29,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:29,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:11:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:29,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:11:29,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:11:29,043 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 02:11:29,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 156 transitions, 2665 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-13 02:11:29,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:29,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 02:11:29,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:30,139 INFO L130 PetriNetUnfolder]: 3965/6041 cut-off events. [2022-12-13 02:11:30,139 INFO L131 PetriNetUnfolder]: For 82333/82333 co-relation queries the response was YES. [2022-12-13 02:11:30,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43909 conditions, 6041 events. 3965/6041 cut-off events. For 82333/82333 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 32364 event pairs, 927 based on Foata normal form. 14/4998 useless extension candidates. Maximal degree in co-relation 40582. Up to 3342 conditions per place. [2022-12-13 02:11:30,179 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 123 selfloop transitions, 83 changer transitions 12/218 dead transitions. [2022-12-13 02:11:30,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 218 transitions, 3716 flow [2022-12-13 02:11:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:11:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:11:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 02:11:30,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 02:11:30,180 INFO L175 Difference]: Start difference. First operand has 117 places, 156 transitions, 2665 flow. Second operand 7 states and 84 transitions. [2022-12-13 02:11:30,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 218 transitions, 3716 flow [2022-12-13 02:11:30,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 218 transitions, 3636 flow, removed 35 selfloop flow, removed 1 redundant places. [2022-12-13 02:11:30,353 INFO L231 Difference]: Finished difference. Result has 126 places, 164 transitions, 3056 flow [2022-12-13 02:11:30,353 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2623, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3056, PETRI_PLACES=126, PETRI_TRANSITIONS=164} [2022-12-13 02:11:30,353 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2022-12-13 02:11:30,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:30,353 INFO L89 Accepts]: Start accepts. Operand has 126 places, 164 transitions, 3056 flow [2022-12-13 02:11:30,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:30,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:30,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 164 transitions, 3056 flow [2022-12-13 02:11:30,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 164 transitions, 3056 flow [2022-12-13 02:11:30,497 INFO L130 PetriNetUnfolder]: 632/1545 cut-off events. [2022-12-13 02:11:30,497 INFO L131 PetriNetUnfolder]: For 22598/22732 co-relation queries the response was YES. [2022-12-13 02:11:30,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11026 conditions, 1545 events. 632/1545 cut-off events. For 22598/22732 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11431 event pairs, 81 based on Foata normal form. 43/1291 useless extension candidates. Maximal degree in co-relation 10350. Up to 549 conditions per place. [2022-12-13 02:11:30,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 164 transitions, 3056 flow [2022-12-13 02:11:30,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 1290 [2022-12-13 02:11:30,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:30,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 02:11:30,515 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 164 transitions, 3056 flow [2022-12-13 02:11:30,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-13 02:11:30,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:30,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:30,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 02:11:30,515 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash 948309449, now seen corresponding path program 3 times [2022-12-13 02:11:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:30,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255985070] [2022-12-13 02:11:30,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:30,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:31,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:31,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255985070] [2022-12-13 02:11:31,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255985070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:31,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:31,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:11:31,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248410313] [2022-12-13 02:11:31,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:31,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:11:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:11:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:11:31,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 02:11:31,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 164 transitions, 3056 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-13 02:11:31,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:31,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 02:11:31,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:32,794 INFO L130 PetriNetUnfolder]: 4054/6204 cut-off events. [2022-12-13 02:11:32,794 INFO L131 PetriNetUnfolder]: For 106119/106119 co-relation queries the response was YES. [2022-12-13 02:11:32,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47165 conditions, 6204 events. 4054/6204 cut-off events. For 106119/106119 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 33846 event pairs, 1448 based on Foata normal form. 16/5140 useless extension candidates. Maximal degree in co-relation 44021. Up to 5852 conditions per place. [2022-12-13 02:11:32,830 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 184 selfloop transitions, 17 changer transitions 20/221 dead transitions. [2022-12-13 02:11:32,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 221 transitions, 4006 flow [2022-12-13 02:11:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:11:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:11:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-13 02:11:32,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.354978354978355 [2022-12-13 02:11:32,831 INFO L175 Difference]: Start difference. First operand has 125 places, 164 transitions, 3056 flow. Second operand 7 states and 82 transitions. [2022-12-13 02:11:32,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 221 transitions, 4006 flow [2022-12-13 02:11:32,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 221 transitions, 3856 flow, removed 31 selfloop flow, removed 7 redundant places. [2022-12-13 02:11:32,997 INFO L231 Difference]: Finished difference. Result has 128 places, 174 transitions, 3167 flow [2022-12-13 02:11:32,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2940, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3167, PETRI_PLACES=128, PETRI_TRANSITIONS=174} [2022-12-13 02:11:32,997 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2022-12-13 02:11:32,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:32,998 INFO L89 Accepts]: Start accepts. Operand has 128 places, 174 transitions, 3167 flow [2022-12-13 02:11:32,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:32,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:32,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 174 transitions, 3167 flow [2022-12-13 02:11:33,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 174 transitions, 3167 flow [2022-12-13 02:11:33,150 INFO L130 PetriNetUnfolder]: 670/1622 cut-off events. [2022-12-13 02:11:33,150 INFO L131 PetriNetUnfolder]: For 21883/22023 co-relation queries the response was YES. [2022-12-13 02:11:33,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11724 conditions, 1622 events. 670/1622 cut-off events. For 21883/22023 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12104 event pairs, 82 based on Foata normal form. 45/1354 useless extension candidates. Maximal degree in co-relation 10761. Up to 590 conditions per place. [2022-12-13 02:11:33,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 174 transitions, 3167 flow [2022-12-13 02:11:33,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-13 02:11:33,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [885] L128-4-->L129-3: Formula: (and (= (store |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre24#1_33|)) |v_#memory_int_195|) (= (+ |v_#pthreadsForks_57| 1) |v_#pthreadsForks_56|) (= |v_#pthreadsForks_57| |v_ULTIMATE.start_main_#t~pre24#1_33|)) InVars {#pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_196|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_13|, #pthreadsForks=|v_#pthreadsForks_56|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_33|, #memory_int=|v_#memory_int_195|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-13 02:11:33,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [905] L49-5-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_In_1) (< v_~q1_back~0_In_1 v_~n1~0_In_1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (select (select |v_#memory_int_In_3| v_~q1~0.base_In_1) (+ v_~q1~0.offset_In_1 (* v_~q1_back~0_In_1 4))) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_In_1| v_~N~0_In_3)) (= (+ v_~q1_back~0_In_1 1) v_~q1_back~0_Out_2) (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_2|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= (+ v_~C~0_In_1 v_~x~0_In_1) v_~x~0_Out_2)) InVars {~q1~0.offset=v_~q1~0.offset_In_1, ~C~0=v_~C~0_In_1, ~q1_back~0=v_~q1_back~0_In_1, ~n1~0=v_~n1~0_In_1, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_1|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, ~N~0=v_~N~0_In_3, ~x~0=v_~x~0_In_1} OutVars{~q1~0.offset=v_~q1~0.offset_In_1, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~C~0=v_~C~0_In_1, ~n1~0=v_~n1~0_In_1, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, ~N~0=v_~N~0_In_3, ~q1_back~0=v_~q1_back~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_1|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_2|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_2|, ~x~0=v_~x~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 02:11:33,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [905] L49-5-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_In_1) (< v_~q1_back~0_In_1 v_~n1~0_In_1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (select (select |v_#memory_int_In_3| v_~q1~0.base_In_1) (+ v_~q1~0.offset_In_1 (* v_~q1_back~0_In_1 4))) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_In_1| v_~N~0_In_3)) (= (+ v_~q1_back~0_In_1 1) v_~q1_back~0_Out_2) (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_2|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= (+ v_~C~0_In_1 v_~x~0_In_1) v_~x~0_Out_2)) InVars {~q1~0.offset=v_~q1~0.offset_In_1, ~C~0=v_~C~0_In_1, ~q1_back~0=v_~q1_back~0_In_1, ~n1~0=v_~n1~0_In_1, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_1|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, ~N~0=v_~N~0_In_3, ~x~0=v_~x~0_In_1} OutVars{~q1~0.offset=v_~q1~0.offset_In_1, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~C~0=v_~C~0_In_1, ~n1~0=v_~n1~0_In_1, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, ~N~0=v_~N~0_In_3, ~q1_back~0=v_~q1_back~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_1|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_2|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_2|, ~x~0=v_~x~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 02:11:33,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [844] L49-5-->L49-5: Formula: (and (= (+ v_~q1_back~0_137 1) v_~q1_back~0_136) (not (= (ite (and (<= 0 v_~q1_back~0_137) (< v_~q1_back~0_137 v_~n1~0_67)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_49 (+ v_~x~0_50 v_~C~0_39)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_28| 1) |v_thread1Thread1of1ForFork1_~i~0#1_27|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|) (< |v_thread1Thread1of1ForFork1_~i~0#1_28| v_~N~0_41) (= (ite (= (select (select |v_#memory_int_137| v_~q1~0.base_76) (+ v_~q1~0.offset_76 (* v_~q1_back~0_137 4))) 1) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {~q1~0.offset=v_~q1~0.offset_76, ~C~0=v_~C~0_39, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_28|, ~q1~0.base=v_~q1~0.base_76, #memory_int=|v_#memory_int_137|, ~N~0=v_~N~0_41, ~x~0=v_~x~0_50} OutVars{~q1~0.offset=v_~q1~0.offset_76, ~C~0=v_~C~0_39, ~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_17|, ~N~0=v_~N~0_41, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_17|, ~q1_back~0=v_~q1_back~0_136, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_17|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~q1~0.base=v_~q1~0.base_76, #memory_int=|v_#memory_int_137|, ~x~0=v_~x~0_49, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 02:11:33,820 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [844] L49-5-->L49-5: Formula: (and (= (+ v_~q1_back~0_137 1) v_~q1_back~0_136) (not (= (ite (and (<= 0 v_~q1_back~0_137) (< v_~q1_back~0_137 v_~n1~0_67)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_49 (+ v_~x~0_50 v_~C~0_39)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_28| 1) |v_thread1Thread1of1ForFork1_~i~0#1_27|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|) (< |v_thread1Thread1of1ForFork1_~i~0#1_28| v_~N~0_41) (= (ite (= (select (select |v_#memory_int_137| v_~q1~0.base_76) (+ v_~q1~0.offset_76 (* v_~q1_back~0_137 4))) 1) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {~q1~0.offset=v_~q1~0.offset_76, ~C~0=v_~C~0_39, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_28|, ~q1~0.base=v_~q1~0.base_76, #memory_int=|v_#memory_int_137|, ~N~0=v_~N~0_41, ~x~0=v_~x~0_50} OutVars{~q1~0.offset=v_~q1~0.offset_76, ~C~0=v_~C~0_39, ~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_17|, ~N~0=v_~N~0_41, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_17|, ~q1_back~0=v_~q1_back~0_136, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_17|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~q1~0.base=v_~q1~0.base_76, #memory_int=|v_#memory_int_137|, ~x~0=v_~x~0_49, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 02:11:33,956 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [905] L49-5-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_In_1) (< v_~q1_back~0_In_1 v_~n1~0_In_1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (select (select |v_#memory_int_In_3| v_~q1~0.base_In_1) (+ v_~q1~0.offset_In_1 (* v_~q1_back~0_In_1 4))) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_In_1| v_~N~0_In_3)) (= (+ v_~q1_back~0_In_1 1) v_~q1_back~0_Out_2) (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_2|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= (+ v_~C~0_In_1 v_~x~0_In_1) v_~x~0_Out_2)) InVars {~q1~0.offset=v_~q1~0.offset_In_1, ~C~0=v_~C~0_In_1, ~q1_back~0=v_~q1_back~0_In_1, ~n1~0=v_~n1~0_In_1, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_1|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, ~N~0=v_~N~0_In_3, ~x~0=v_~x~0_In_1} OutVars{~q1~0.offset=v_~q1~0.offset_In_1, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_Out_2|, ~C~0=v_~C~0_In_1, ~n1~0=v_~n1~0_In_1, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_Out_2|, ~N~0=v_~N~0_In_3, ~q1_back~0=v_~q1_back~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_1|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_2|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_2|, ~x~0=v_~x~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 02:11:34,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [844] L49-5-->L49-5: Formula: (and (= (+ v_~q1_back~0_137 1) v_~q1_back~0_136) (not (= (ite (and (<= 0 v_~q1_back~0_137) (< v_~q1_back~0_137 v_~n1~0_67)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_49 (+ v_~x~0_50 v_~C~0_39)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_28| 1) |v_thread1Thread1of1ForFork1_~i~0#1_27|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|) (< |v_thread1Thread1of1ForFork1_~i~0#1_28| v_~N~0_41) (= (ite (= (select (select |v_#memory_int_137| v_~q1~0.base_76) (+ v_~q1~0.offset_76 (* v_~q1_back~0_137 4))) 1) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {~q1~0.offset=v_~q1~0.offset_76, ~C~0=v_~C~0_39, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_28|, ~q1~0.base=v_~q1~0.base_76, #memory_int=|v_#memory_int_137|, ~N~0=v_~N~0_41, ~x~0=v_~x~0_50} OutVars{~q1~0.offset=v_~q1~0.offset_76, ~C~0=v_~C~0_39, ~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_17|, ~N~0=v_~N~0_41, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_17|, ~q1_back~0=v_~q1_back~0_136, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_17|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_27|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~q1~0.base=v_~q1~0.base_76, #memory_int=|v_#memory_int_137|, ~x~0=v_~x~0_49, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 02:11:34,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [968] L75-->thread1EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_113| (ite (= (select (select |v_#memory_int_421| v_~q2~0.base_203) (+ v_~q2~0.offset_203 (* 4 v_~q2_back~0_303))) |v_thread2Thread1of1ForFork2_~j~0#1_125|) 1 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_79| v_~N~0_137)) (= v_~y~0_209 (+ v_~y~0_210 v_~C~0_209)) (= |v_thread1Thread1of1ForFork1_#res#1.base_35| 0) (= (+ v_~x~0_164 v_~C~0_209) v_~x~0_163) (= |v_thread1Thread1of1ForFork1_#res#1.offset_35| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_113| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_113|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_113| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_57| 0) (= (ite (= 0 (select (select |v_#memory_int_421| v_~q1~0.base_176) (+ v_~q1~0.offset_176 (* v_~q1_back~0_264 4)))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|) (not (= (ite (and (< v_~q1_back~0_264 v_~n1~0_163) (<= 0 v_~q1_back~0_264)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_57| 0) (= v_~q1_back~0_263 (+ v_~q1_back~0_264 1)) (= (+ v_~q2_back~0_303 1) v_~q2_back~0_302) (not (= (ite (and (< v_~q2_back~0_303 v_~n2~0_227) (<= 0 v_~q2_back~0_303)) 1 0) 0)) (= (+ v_~s~0_220 |v_thread2Thread1of1ForFork2_~j~0#1_125|) v_~s~0_219) (= |v_thread2Thread1of1ForFork2_~j~0#1_125| 0)) InVars {~q1~0.offset=v_~q1~0.offset_176, ~n2~0=v_~n2~0_227, ~C~0=v_~C~0_209, ~n1~0=v_~n1~0_163, ~q2~0.offset=v_~q2~0.offset_203, ~N~0=v_~N~0_137, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_125|, ~q1_back~0=v_~q1_back~0_264, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_79|, ~q1~0.base=v_~q1~0.base_176, #memory_int=|v_#memory_int_421|, ~q2~0.base=v_~q2~0.base_203, ~y~0=v_~y~0_210, ~x~0=v_~x~0_164, ~q2_back~0=v_~q2_back~0_303, ~s~0=v_~s~0_220} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_87|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_57|, ~n1~0=v_~n1~0_163, ~q2~0.offset=v_~q2~0.offset_203, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_113|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_87|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_57|, ~q1_back~0=v_~q1_back~0_263, ~q1~0.base=v_~q1~0.base_176, ~q2~0.base=v_~q2~0.base_203, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_35|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_35|, ~y~0=v_~y~0_209, ~q2_back~0=v_~q2_back~0_302, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|, ~s~0=v_~s~0_219, ~q1~0.offset=v_~q1~0.offset_176, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_35|, ~n2~0=v_~n2~0_227, ~C~0=v_~C~0_209, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_35|, ~N~0=v_~N~0_137, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_125|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_113|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_79|, #memory_int=|v_#memory_int_421|, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread1Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~y~0, ~x~0, ~q2_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~s~0] and [885] L128-4-->L129-3: Formula: (and (= (store |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre24#1_33|)) |v_#memory_int_195|) (= (+ |v_#pthreadsForks_57| 1) |v_#pthreadsForks_56|) (= |v_#pthreadsForks_57| |v_ULTIMATE.start_main_#t~pre24#1_33|)) InVars {#pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_196|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_13|, #pthreadsForks=|v_#pthreadsForks_56|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_33|, #memory_int=|v_#memory_int_195|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-13 02:11:34,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [970] L75-->L49-5: Formula: (and (= (+ v_~q1_back~0_272 1) v_~q1_back~0_271) (< |v_thread1Thread1of1ForFork1_~i~0#1_86| v_~N~0_141) (= |v_thread2Thread1of1ForFork2_#res#1.offset_61| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_61| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_117| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_117|) (not (= (ite (and (< v_~q2_back~0_311 v_~n2~0_231) (<= 0 v_~q2_back~0_311)) 1 0) 0)) (= (+ v_~q2_back~0_311 1) v_~q2_back~0_310) (not (= (ite (and (< v_~q1_back~0_272 v_~n1~0_167) (<= 0 v_~q1_back~0_272)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_65|) (= (+ v_~s~0_228 |v_thread2Thread1of1ForFork2_~j~0#1_129|) v_~s~0_227) (= v_~y~0_217 (+ v_~y~0_218 v_~C~0_213)) (= (+ v_~x~0_172 v_~C~0_213) v_~x~0_171) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_117| (ite (= (select (select |v_#memory_int_425| v_~q2~0.base_207) (+ v_~q2~0.offset_207 (* 4 v_~q2_back~0_311))) |v_thread2Thread1of1ForFork2_~j~0#1_129|) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_117| 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_86| 1) |v_thread1Thread1of1ForFork1_~i~0#1_85|) (= |v_thread2Thread1of1ForFork2_~j~0#1_129| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (= (select (select |v_#memory_int_425| v_~q1~0.base_180) (+ v_~q1~0.offset_180 (* v_~q1_back~0_272 4))) 1) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_180, ~n2~0=v_~n2~0_231, ~C~0=v_~C~0_213, ~n1~0=v_~n1~0_167, ~q2~0.offset=v_~q2~0.offset_207, ~N~0=v_~N~0_141, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_129|, ~q1_back~0=v_~q1_back~0_272, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_86|, ~q1~0.base=v_~q1~0.base_180, #memory_int=|v_#memory_int_425|, ~q2~0.base=v_~q2~0.base_207, ~y~0=v_~y~0_218, ~x~0=v_~x~0_172, ~q2_back~0=v_~q2_back~0_311, ~s~0=v_~s~0_228} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_91|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_61|, ~n1~0=v_~n1~0_167, ~q2~0.offset=v_~q2~0.offset_207, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_31|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_117|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_91|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_61|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_33|, ~q1_back~0=v_~q1_back~0_271, ~q1~0.base=v_~q1~0.base_180, ~q2~0.base=v_~q2~0.base_207, ~y~0=v_~y~0_217, ~q2_back~0=v_~q2_back~0_310, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_65|, ~s~0=v_~s~0_227, ~q1~0.offset=v_~q1~0.offset_180, ~n2~0=v_~n2~0_231, ~C~0=v_~C~0_213, ~N~0=v_~N~0_141, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_129|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_117|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_31|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_85|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, #memory_int=|v_#memory_int_425|, ~x~0=v_~x~0_171} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork1_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, thread2Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork1_#t~post1#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~y~0, ~x~0, ~q2_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~s~0] and [885] L128-4-->L129-3: Formula: (and (= (store |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre24#1_33|)) |v_#memory_int_195|) (= (+ |v_#pthreadsForks_57| 1) |v_#pthreadsForks_56|) (= |v_#pthreadsForks_57| |v_ULTIMATE.start_main_#t~pre24#1_33|)) InVars {#pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_196|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_13|, #pthreadsForks=|v_#pthreadsForks_56|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_33|, #memory_int=|v_#memory_int_195|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-13 02:11:34,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [971] L75-->thread1EXIT: Formula: (and (= (+ v_~q2_back~0_315 1) v_~q2_back~0_314) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_67| 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_119| 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_89| v_~N~0_143)) (= (+ v_~s~0_232 |v_thread2Thread1of1ForFork2_~j~0#1_131|) v_~s~0_231) (not (= (ite (and (< v_~q1_back~0_276 v_~n1~0_169) (<= 0 v_~q1_back~0_276)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_67| (ite (= (select (select |v_#memory_int_427| v_~q1~0.base_182) (+ v_~q1~0.offset_182 (* v_~q1_back~0_276 4))) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_67| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_67|) (= (+ v_~q1_back~0_276 1) v_~q1_back~0_275) (= |v_thread1Thread1of1ForFork1_#res#1.offset_37| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_119|) (= |v_thread2Thread1of1ForFork2_~j~0#1_131| 0) (= (+ v_~x~0_176 v_~C~0_215) v_~x~0_175) (= |v_thread1Thread1of1ForFork1_#res#1.base_37| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_63| 0) (= v_~y~0_221 (+ v_~y~0_222 v_~C~0_215)) (not (= (ite (and (< v_~q2_back~0_315 v_~n2~0_233) (<= 0 v_~q2_back~0_315)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_63| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_119| (ite (= (select (select |v_#memory_int_427| v_~q2~0.base_209) (+ v_~q2~0.offset_209 (* 4 v_~q2_back~0_315))) |v_thread2Thread1of1ForFork2_~j~0#1_131|) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_182, ~n2~0=v_~n2~0_233, ~C~0=v_~C~0_215, ~n1~0=v_~n1~0_169, ~q2~0.offset=v_~q2~0.offset_209, ~N~0=v_~N~0_143, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_131|, ~q1_back~0=v_~q1_back~0_276, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_89|, ~q1~0.base=v_~q1~0.base_182, #memory_int=|v_#memory_int_427|, ~q2~0.base=v_~q2~0.base_209, ~y~0=v_~y~0_222, ~x~0=v_~x~0_176, ~q2_back~0=v_~q2_back~0_315, ~s~0=v_~s~0_232} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_93|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_63|, ~n1~0=v_~n1~0_169, ~q2~0.offset=v_~q2~0.offset_209, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_119|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_93|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_63|, ~q1_back~0=v_~q1_back~0_275, ~q1~0.base=v_~q1~0.base_182, ~q2~0.base=v_~q2~0.base_209, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_37|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_37|, ~y~0=v_~y~0_221, ~q2_back~0=v_~q2_back~0_314, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_67|, ~s~0=v_~s~0_231, ~q1~0.offset=v_~q1~0.offset_182, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_37|, ~n2~0=v_~n2~0_233, ~C~0=v_~C~0_215, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_37|, ~N~0=v_~N~0_143, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_131|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_119|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_67|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_89|, #memory_int=|v_#memory_int_427|, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread1Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~y~0, ~x~0, ~q2_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~s~0] and [885] L128-4-->L129-3: Formula: (and (= (store |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre24#1_33|)) |v_#memory_int_195|) (= (+ |v_#pthreadsForks_57| 1) |v_#pthreadsForks_56|) (= |v_#pthreadsForks_57| |v_ULTIMATE.start_main_#t~pre24#1_33|)) InVars {#pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_196|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_13|, #pthreadsForks=|v_#pthreadsForks_56|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_33|, #memory_int=|v_#memory_int_195|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-13 02:11:34,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [967] L75-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_33| 0) (= v_~y~0_205 (+ v_~y~0_206 v_~C~0_207)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_111| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_55| 0) (not (= (ite (and (<= 0 v_~q1_back~0_260) (< v_~q1_back~0_260 v_~n1~0_161)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_~j~0#1_123| 0) (= (+ v_~s~0_216 |v_thread2Thread1of1ForFork2_~j~0#1_123|) v_~s~0_215) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (not (< |v_thread1Thread1of1ForFork1_~i~0#1_77| v_~N~0_135)) (not (= (ite (and (< v_~q2_back~0_299 v_~n2~0_225) (<= 0 v_~q2_back~0_299)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_111| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_111|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_33| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59| (ite (= (select (select |v_#memory_int_419| v_~q1~0.base_174) (+ v_~q1~0.offset_174 (* v_~q1_back~0_260 4))) 0) 1 0)) (= (ite (= (select (select |v_#memory_int_419| v_~q2~0.base_201) (+ (* 4 v_~q2_back~0_299) v_~q2~0.offset_201)) |v_thread2Thread1of1ForFork2_~j~0#1_123|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_111|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|) (= |v_thread2Thread1of1ForFork2_#res#1.base_55| 0) (= (+ v_~x~0_160 v_~C~0_207) v_~x~0_159) (= (+ v_~q2_back~0_299 1) v_~q2_back~0_298) (= (+ v_~q1_back~0_260 1) v_~q1_back~0_259)) InVars {~q1~0.offset=v_~q1~0.offset_174, ~n2~0=v_~n2~0_225, ~C~0=v_~C~0_207, ~n1~0=v_~n1~0_161, ~q2~0.offset=v_~q2~0.offset_201, ~N~0=v_~N~0_135, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_123|, ~q1_back~0=v_~q1_back~0_260, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_77|, ~q1~0.base=v_~q1~0.base_174, #memory_int=|v_#memory_int_419|, ~q2~0.base=v_~q2~0.base_201, ~y~0=v_~y~0_206, ~x~0=v_~x~0_160, ~q2_back~0=v_~q2_back~0_299, ~s~0=v_~s~0_216} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_85|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_55|, ~n1~0=v_~n1~0_161, ~q2~0.offset=v_~q2~0.offset_201, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_111|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_85|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_55|, ~q1_back~0=v_~q1_back~0_259, ~q1~0.base=v_~q1~0.base_174, ~q2~0.base=v_~q2~0.base_201, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_33|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_33|, ~y~0=v_~y~0_205, ~q2_back~0=v_~q2_back~0_298, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, ~s~0=v_~s~0_215, ~q1~0.offset=v_~q1~0.offset_174, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_33|, ~n2~0=v_~n2~0_225, ~C~0=v_~C~0_207, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_33|, ~N~0=v_~N~0_135, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_123|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_111|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_77|, #memory_int=|v_#memory_int_419|, ~x~0=v_~x~0_159} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread1Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~y~0, ~x~0, ~q2_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~s~0] and [885] L128-4-->L129-3: Formula: (and (= (store |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_196| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre24#1_33|)) |v_#memory_int_195|) (= (+ |v_#pthreadsForks_57| 1) |v_#pthreadsForks_56|) (= |v_#pthreadsForks_57| |v_ULTIMATE.start_main_#t~pre24#1_33|)) InVars {#pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, #memory_int=|v_#memory_int_196|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_13|, #pthreadsForks=|v_#pthreadsForks_56|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_41|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_33|, #memory_int=|v_#memory_int_195|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-13 02:11:35,053 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:11:35,053 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2056 [2022-12-13 02:11:35,054 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 174 transitions, 3318 flow [2022-12-13 02:11:35,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-13 02:11:35,054 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:35,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:35,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 02:11:35,054 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:35,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -200528045, now seen corresponding path program 4 times [2022-12-13 02:11:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:35,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660595757] [2022-12-13 02:11:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:36,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:36,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660595757] [2022-12-13 02:11:36,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660595757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:36,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:36,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:11:36,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159912134] [2022-12-13 02:11:36,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:36,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:11:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:36,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:11:36,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:11:36,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 02:11:36,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 174 transitions, 3318 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-13 02:11:36,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:36,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 02:11:36,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:37,167 INFO L130 PetriNetUnfolder]: 3914/5965 cut-off events. [2022-12-13 02:11:37,167 INFO L131 PetriNetUnfolder]: For 103679/103679 co-relation queries the response was YES. [2022-12-13 02:11:37,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46360 conditions, 5965 events. 3914/5965 cut-off events. For 103679/103679 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 31987 event pairs, 1433 based on Foata normal form. 51/4971 useless extension candidates. Maximal degree in co-relation 44450. Up to 5804 conditions per place. [2022-12-13 02:11:37,214 INFO L137 encePairwiseOnDemand]: 24/40 looper letters, 166 selfloop transitions, 9 changer transitions 22/197 dead transitions. [2022-12-13 02:11:37,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 197 transitions, 3688 flow [2022-12-13 02:11:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-13 02:11:37,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-13 02:11:37,215 INFO L175 Difference]: Start difference. First operand has 128 places, 174 transitions, 3318 flow. Second operand 6 states and 75 transitions. [2022-12-13 02:11:37,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 197 transitions, 3688 flow [2022-12-13 02:11:37,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 197 transitions, 3611 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 02:11:37,419 INFO L231 Difference]: Finished difference. Result has 129 places, 167 transitions, 3007 flow [2022-12-13 02:11:37,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2982, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3007, PETRI_PLACES=129, PETRI_TRANSITIONS=167} [2022-12-13 02:11:37,420 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2022-12-13 02:11:37,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:37,420 INFO L89 Accepts]: Start accepts. Operand has 129 places, 167 transitions, 3007 flow [2022-12-13 02:11:37,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:37,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:37,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 167 transitions, 3007 flow [2022-12-13 02:11:37,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 167 transitions, 3007 flow [2022-12-13 02:11:37,585 INFO L130 PetriNetUnfolder]: 638/1554 cut-off events. [2022-12-13 02:11:37,585 INFO L131 PetriNetUnfolder]: For 20128/20264 co-relation queries the response was YES. [2022-12-13 02:11:37,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11021 conditions, 1554 events. 638/1554 cut-off events. For 20128/20264 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11532 event pairs, 76 based on Foata normal form. 45/1298 useless extension candidates. Maximal degree in co-relation 10569. Up to 546 conditions per place. [2022-12-13 02:11:37,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 167 transitions, 3007 flow [2022-12-13 02:11:37,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 1286 [2022-12-13 02:11:37,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L75-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|) (= 0 |v_thread2Thread1of1ForFork2_~j~0#1_45|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= (select (select |v_#memory_int_189| v_~q2~0.base_61) (+ v_~q2~0.offset_61 (* v_~q2_back~0_95 4))) |v_thread2Thread1of1ForFork2_~j~0#1_45|) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~q2_back~0_95 v_~n2~0_80) (<= 0 v_~q2_back~0_95)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~s~0_51 (+ v_~s~0_52 |v_thread2Thread1of1ForFork2_~j~0#1_45|)) (= v_~q2_back~0_94 (+ v_~q2_back~0_95 1)) (= |v_thread2Thread1of1ForFork2_#res#1.base_13| 0) (= (+ v_~y~0_42 v_~C~0_61) v_~y~0_41)) InVars {~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, ~y~0=v_~y~0_42, ~q2_back~0=v_~q2_back~0_95, ~s~0=v_~s~0_52} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_19|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_13|, ~n2~0=v_~n2~0_80, ~C~0=v_~C~0_61, ~q2~0.offset=v_~q2~0.offset_61, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_33|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_45|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_19|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_189|, ~q2~0.base=v_~q2~0.base_61, ~y~0=v_~y~0_41, ~q2_back~0=v_~q2_back~0_94, ~s~0=v_~s~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~y~0, thread2Thread1of1ForFork2_#res#1.base, ~q2_back~0, ~s~0] and [913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0] [2022-12-13 02:11:37,948 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:11:37,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 529 [2022-12-13 02:11:37,949 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 166 transitions, 3011 flow [2022-12-13 02:11:37,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-13 02:11:37,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:37,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:37,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 02:11:37,949 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:37,950 INFO L85 PathProgramCache]: Analyzing trace with hash 573745300, now seen corresponding path program 1 times [2022-12-13 02:11:37,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:37,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194250256] [2022-12-13 02:11:37,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:37,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:38,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:38,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194250256] [2022-12-13 02:11:38,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194250256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:38,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:38,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:11:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110867801] [2022-12-13 02:11:38,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:38,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:11:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:38,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:11:38,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:11:38,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 02:11:38,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 166 transitions, 3011 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-12-13 02:11:38,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:38,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 02:11:38,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:39,251 INFO L130 PetriNetUnfolder]: 3870/5890 cut-off events. [2022-12-13 02:11:39,251 INFO L131 PetriNetUnfolder]: For 93349/93349 co-relation queries the response was YES. [2022-12-13 02:11:39,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45457 conditions, 5890 events. 3870/5890 cut-off events. For 93349/93349 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 31564 event pairs, 1078 based on Foata normal form. 7/4870 useless extension candidates. Maximal degree in co-relation 44063. Up to 5597 conditions per place. [2022-12-13 02:11:39,288 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 146 selfloop transitions, 35 changer transitions 5/186 dead transitions. [2022-12-13 02:11:39,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 186 transitions, 3495 flow [2022-12-13 02:11:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:11:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:11:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-13 02:11:39,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35428571428571426 [2022-12-13 02:11:39,289 INFO L175 Difference]: Start difference. First operand has 127 places, 166 transitions, 3011 flow. Second operand 5 states and 62 transitions. [2022-12-13 02:11:39,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 186 transitions, 3495 flow [2022-12-13 02:11:39,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 186 transitions, 3459 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 02:11:39,454 INFO L231 Difference]: Finished difference. Result has 128 places, 165 transitions, 3019 flow [2022-12-13 02:11:39,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3019, PETRI_PLACES=128, PETRI_TRANSITIONS=165} [2022-12-13 02:11:39,455 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2022-12-13 02:11:39,455 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:39,455 INFO L89 Accepts]: Start accepts. Operand has 128 places, 165 transitions, 3019 flow [2022-12-13 02:11:39,456 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:39,456 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:39,456 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 165 transitions, 3019 flow [2022-12-13 02:11:39,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 165 transitions, 3019 flow [2022-12-13 02:11:39,604 INFO L130 PetriNetUnfolder]: 635/1542 cut-off events. [2022-12-13 02:11:39,604 INFO L131 PetriNetUnfolder]: For 20913/21052 co-relation queries the response was YES. [2022-12-13 02:11:39,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11087 conditions, 1542 events. 635/1542 cut-off events. For 20913/21052 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 11381 event pairs, 76 based on Foata normal form. 48/1295 useless extension candidates. Maximal degree in co-relation 10692. Up to 543 conditions per place. [2022-12-13 02:11:39,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 165 transitions, 3019 flow [2022-12-13 02:11:39,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 1280 [2022-12-13 02:11:39,623 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:39,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 02:11:39,624 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 165 transitions, 3019 flow [2022-12-13 02:11:39,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-12-13 02:11:39,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:39,624 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:39,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 02:11:39,624 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:39,625 INFO L85 PathProgramCache]: Analyzing trace with hash 286764388, now seen corresponding path program 1 times [2022-12-13 02:11:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:39,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269415945] [2022-12-13 02:11:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:40,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269415945] [2022-12-13 02:11:40,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269415945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:40,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:40,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:11:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240232723] [2022-12-13 02:11:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:40,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:11:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:40,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:11:40,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:11:40,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:11:40,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 165 transitions, 3019 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-12-13 02:11:40,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:40,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:11:40,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:40,998 INFO L130 PetriNetUnfolder]: 4095/6209 cut-off events. [2022-12-13 02:11:40,998 INFO L131 PetriNetUnfolder]: For 102785/102785 co-relation queries the response was YES. [2022-12-13 02:11:41,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48526 conditions, 6209 events. 4095/6209 cut-off events. For 102785/102785 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 33376 event pairs, 1244 based on Foata normal form. 2/5111 useless extension candidates. Maximal degree in co-relation 47175. Up to 5371 conditions per place. [2022-12-13 02:11:41,041 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 162 selfloop transitions, 34 changer transitions 3/199 dead transitions. [2022-12-13 02:11:41,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 199 transitions, 3751 flow [2022-12-13 02:11:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-13 02:11:41,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 02:11:41,042 INFO L175 Difference]: Start difference. First operand has 127 places, 165 transitions, 3019 flow. Second operand 6 states and 68 transitions. [2022-12-13 02:11:41,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 199 transitions, 3751 flow [2022-12-13 02:11:41,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 199 transitions, 3673 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 02:11:41,211 INFO L231 Difference]: Finished difference. Result has 130 places, 167 transitions, 3099 flow [2022-12-13 02:11:41,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2945, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3099, PETRI_PLACES=130, PETRI_TRANSITIONS=167} [2022-12-13 02:11:41,211 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2022-12-13 02:11:41,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:41,211 INFO L89 Accepts]: Start accepts. Operand has 130 places, 167 transitions, 3099 flow [2022-12-13 02:11:41,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:41,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:41,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 167 transitions, 3099 flow [2022-12-13 02:11:41,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 167 transitions, 3099 flow [2022-12-13 02:11:41,362 INFO L130 PetriNetUnfolder]: 653/1570 cut-off events. [2022-12-13 02:11:41,363 INFO L131 PetriNetUnfolder]: For 22012/22172 co-relation queries the response was YES. [2022-12-13 02:11:41,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11473 conditions, 1570 events. 653/1570 cut-off events. For 22012/22172 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 11659 event pairs, 80 based on Foata normal form. 54/1314 useless extension candidates. Maximal degree in co-relation 11096. Up to 555 conditions per place. [2022-12-13 02:11:41,382 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 167 transitions, 3099 flow [2022-12-13 02:11:41,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 1326 [2022-12-13 02:11:41,384 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:41,384 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-13 02:11:41,384 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 167 transitions, 3099 flow [2022-12-13 02:11:41,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-12-13 02:11:41,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:41,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:41,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 02:11:41,385 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 343743489, now seen corresponding path program 5 times [2022-12-13 02:11:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:41,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206125226] [2022-12-13 02:11:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:41,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:41,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206125226] [2022-12-13 02:11:41,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206125226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:41,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:41,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:11:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031213259] [2022-12-13 02:11:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:41,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:11:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:41,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:11:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:11:41,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 02:11:41,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 167 transitions, 3099 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-12-13 02:11:41,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:41,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 02:11:41,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:42,872 INFO L130 PetriNetUnfolder]: 4351/6684 cut-off events. [2022-12-13 02:11:42,873 INFO L131 PetriNetUnfolder]: For 115698/115698 co-relation queries the response was YES. [2022-12-13 02:11:42,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51972 conditions, 6684 events. 4351/6684 cut-off events. For 115698/115698 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 37531 event pairs, 869 based on Foata normal form. 51/5577 useless extension candidates. Maximal degree in co-relation 50030. Up to 3282 conditions per place. [2022-12-13 02:11:42,922 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 136 selfloop transitions, 78 changer transitions 1/215 dead transitions. [2022-12-13 02:11:42,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 215 transitions, 3957 flow [2022-12-13 02:11:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-13 02:11:42,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2022-12-13 02:11:42,923 INFO L175 Difference]: Start difference. First operand has 128 places, 167 transitions, 3099 flow. Second operand 6 states and 78 transitions. [2022-12-13 02:11:42,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 215 transitions, 3957 flow [2022-12-13 02:11:43,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 215 transitions, 3898 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 02:11:43,138 INFO L231 Difference]: Finished difference. Result has 132 places, 173 transitions, 3485 flow [2022-12-13 02:11:43,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3050, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3485, PETRI_PLACES=132, PETRI_TRANSITIONS=173} [2022-12-13 02:11:43,139 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2022-12-13 02:11:43,139 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:43,139 INFO L89 Accepts]: Start accepts. Operand has 132 places, 173 transitions, 3485 flow [2022-12-13 02:11:43,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:43,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:43,141 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 173 transitions, 3485 flow [2022-12-13 02:11:43,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 173 transitions, 3485 flow [2022-12-13 02:11:43,306 INFO L130 PetriNetUnfolder]: 676/1662 cut-off events. [2022-12-13 02:11:43,306 INFO L131 PetriNetUnfolder]: For 29266/29440 co-relation queries the response was YES. [2022-12-13 02:11:43,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13061 conditions, 1662 events. 676/1662 cut-off events. For 29266/29440 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 12747 event pairs, 82 based on Foata normal form. 58/1394 useless extension candidates. Maximal degree in co-relation 11902. Up to 581 conditions per place. [2022-12-13 02:11:43,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 173 transitions, 3485 flow [2022-12-13 02:11:43,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 1392 [2022-12-13 02:11:43,398 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:43,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 260 [2022-12-13 02:11:43,399 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 173 transitions, 3485 flow [2022-12-13 02:11:43,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-12-13 02:11:43,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:43,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:43,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 02:11:43,399 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1106953555, now seen corresponding path program 6 times [2022-12-13 02:11:43,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:43,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458648702] [2022-12-13 02:11:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:44,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:44,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458648702] [2022-12-13 02:11:44,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458648702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:44,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:44,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:11:44,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461484533] [2022-12-13 02:11:44,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:44,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:11:44,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:44,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:11:44,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:11:44,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 02:11:44,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 173 transitions, 3485 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-13 02:11:44,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:44,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 02:11:44,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:45,611 INFO L130 PetriNetUnfolder]: 4303/6580 cut-off events. [2022-12-13 02:11:45,611 INFO L131 PetriNetUnfolder]: For 143228/143228 co-relation queries the response was YES. [2022-12-13 02:11:45,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55052 conditions, 6580 events. 4303/6580 cut-off events. For 143228/143228 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 36350 event pairs, 1659 based on Foata normal form. 28/5450 useless extension candidates. Maximal degree in co-relation 49856. Up to 6420 conditions per place. [2022-12-13 02:11:45,659 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 168 selfloop transitions, 4 changer transitions 29/201 dead transitions. [2022-12-13 02:11:45,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 201 transitions, 4118 flow [2022-12-13 02:11:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-13 02:11:45,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3282828282828283 [2022-12-13 02:11:45,660 INFO L175 Difference]: Start difference. First operand has 132 places, 173 transitions, 3485 flow. Second operand 6 states and 65 transitions. [2022-12-13 02:11:45,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 201 transitions, 4118 flow [2022-12-13 02:11:45,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 201 transitions, 4083 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-13 02:11:45,864 INFO L231 Difference]: Finished difference. Result has 137 places, 169 transitions, 3385 flow [2022-12-13 02:11:45,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3458, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3385, PETRI_PLACES=137, PETRI_TRANSITIONS=169} [2022-12-13 02:11:45,864 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2022-12-13 02:11:45,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:45,864 INFO L89 Accepts]: Start accepts. Operand has 137 places, 169 transitions, 3385 flow [2022-12-13 02:11:45,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:45,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:45,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 169 transitions, 3385 flow [2022-12-13 02:11:45,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 169 transitions, 3385 flow [2022-12-13 02:11:46,047 INFO L130 PetriNetUnfolder]: 674/1635 cut-off events. [2022-12-13 02:11:46,047 INFO L131 PetriNetUnfolder]: For 28380/28550 co-relation queries the response was YES. [2022-12-13 02:11:46,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12738 conditions, 1635 events. 674/1635 cut-off events. For 28380/28550 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 12352 event pairs, 80 based on Foata normal form. 54/1368 useless extension candidates. Maximal degree in co-relation 12163. Up to 573 conditions per place. [2022-12-13 02:11:46,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 169 transitions, 3385 flow [2022-12-13 02:11:46,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 1376 [2022-12-13 02:11:46,082 WARN L322 ript$VariableManager]: TermVariable LBE428 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:11:46,082 WARN L322 ript$VariableManager]: TermVariable LBE29 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:11:46,082 WARN L322 ript$VariableManager]: TermVariable LBE416 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:11:46,083 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:11:46,405 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:11:46,406 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 542 [2022-12-13 02:11:46,406 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 169 transitions, 3425 flow [2022-12-13 02:11:46,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2022-12-13 02:11:46,406 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:46,407 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:46,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 02:11:46,407 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash 14514050, now seen corresponding path program 1 times [2022-12-13 02:11:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:46,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923352387] [2022-12-13 02:11:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:46,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:46,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923352387] [2022-12-13 02:11:46,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923352387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:46,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:46,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:11:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918087080] [2022-12-13 02:11:46,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:46,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:11:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:11:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:11:46,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:11:46,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 169 transitions, 3425 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-13 02:11:46,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:46,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:11:46,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:47,879 INFO L130 PetriNetUnfolder]: 4299/6563 cut-off events. [2022-12-13 02:11:47,879 INFO L131 PetriNetUnfolder]: For 136172/136172 co-relation queries the response was YES. [2022-12-13 02:11:47,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54462 conditions, 6563 events. 4299/6563 cut-off events. For 136172/136172 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 36073 event pairs, 875 based on Foata normal form. 16/5424 useless extension candidates. Maximal degree in co-relation 53158. Up to 3872 conditions per place. [2022-12-13 02:11:47,929 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 126 selfloop transitions, 60 changer transitions 17/203 dead transitions. [2022-12-13 02:11:47,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 203 transitions, 4140 flow [2022-12-13 02:11:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:11:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:11:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 02:11:47,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2022-12-13 02:11:47,930 INFO L175 Difference]: Start difference. First operand has 135 places, 169 transitions, 3425 flow. Second operand 5 states and 66 transitions. [2022-12-13 02:11:47,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 203 transitions, 4140 flow [2022-12-13 02:11:48,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 203 transitions, 3994 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-13 02:11:48,196 INFO L231 Difference]: Finished difference. Result has 134 places, 163 transitions, 3313 flow [2022-12-13 02:11:48,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3283, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3313, PETRI_PLACES=134, PETRI_TRANSITIONS=163} [2022-12-13 02:11:48,196 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 102 predicate places. [2022-12-13 02:11:48,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:48,197 INFO L89 Accepts]: Start accepts. Operand has 134 places, 163 transitions, 3313 flow [2022-12-13 02:11:48,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:48,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:48,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 163 transitions, 3313 flow [2022-12-13 02:11:48,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 163 transitions, 3313 flow [2022-12-13 02:11:48,478 INFO L130 PetriNetUnfolder]: 668/1605 cut-off events. [2022-12-13 02:11:48,478 INFO L131 PetriNetUnfolder]: For 30643/30811 co-relation queries the response was YES. [2022-12-13 02:11:48,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12721 conditions, 1605 events. 668/1605 cut-off events. For 30643/30811 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 12049 event pairs, 80 based on Foata normal form. 52/1339 useless extension candidates. Maximal degree in co-relation 12086. Up to 557 conditions per place. [2022-12-13 02:11:48,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 163 transitions, 3313 flow [2022-12-13 02:11:48,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 1354 [2022-12-13 02:11:48,499 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:48,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 303 [2022-12-13 02:11:48,499 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 163 transitions, 3313 flow [2022-12-13 02:11:48,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-13 02:11:48,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:48,500 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:48,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 02:11:48,500 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash -621409678, now seen corresponding path program 1 times [2022-12-13 02:11:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:48,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248541966] [2022-12-13 02:11:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:48,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:49,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:49,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:49,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248541966] [2022-12-13 02:11:49,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248541966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:49,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:49,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:11:49,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154175334] [2022-12-13 02:11:49,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:49,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:11:49,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:49,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:11:49,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:11:49,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:11:49,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 163 transitions, 3313 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:11:49,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:49,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:11:49,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:50,311 INFO L130 PetriNetUnfolder]: 4717/7185 cut-off events. [2022-12-13 02:11:50,311 INFO L131 PetriNetUnfolder]: For 166160/166160 co-relation queries the response was YES. [2022-12-13 02:11:50,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60308 conditions, 7185 events. 4717/7185 cut-off events. For 166160/166160 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 40481 event pairs, 988 based on Foata normal form. 99/6023 useless extension candidates. Maximal degree in co-relation 56958. Up to 3546 conditions per place. [2022-12-13 02:11:50,362 INFO L137 encePairwiseOnDemand]: 17/31 looper letters, 137 selfloop transitions, 79 changer transitions 0/216 dead transitions. [2022-12-13 02:11:50,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 216 transitions, 4274 flow [2022-12-13 02:11:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-13 02:11:50,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2022-12-13 02:11:50,364 INFO L175 Difference]: Start difference. First operand has 130 places, 163 transitions, 3313 flow. Second operand 6 states and 77 transitions. [2022-12-13 02:11:50,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 216 transitions, 4274 flow [2022-12-13 02:11:50,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 216 transitions, 4060 flow, removed 19 selfloop flow, removed 9 redundant places. [2022-12-13 02:11:50,645 INFO L231 Difference]: Finished difference. Result has 131 places, 175 transitions, 3620 flow [2022-12-13 02:11:50,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3107, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3620, PETRI_PLACES=131, PETRI_TRANSITIONS=175} [2022-12-13 02:11:50,645 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 99 predicate places. [2022-12-13 02:11:50,646 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:50,646 INFO L89 Accepts]: Start accepts. Operand has 131 places, 175 transitions, 3620 flow [2022-12-13 02:11:50,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:50,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:50,647 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 175 transitions, 3620 flow [2022-12-13 02:11:50,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 175 transitions, 3620 flow [2022-12-13 02:11:50,827 INFO L130 PetriNetUnfolder]: 757/1831 cut-off events. [2022-12-13 02:11:50,827 INFO L131 PetriNetUnfolder]: For 36372/36561 co-relation queries the response was YES. [2022-12-13 02:11:50,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14532 conditions, 1831 events. 757/1831 cut-off events. For 36372/36561 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 14235 event pairs, 112 based on Foata normal form. 66/1532 useless extension candidates. Maximal degree in co-relation 13347. Up to 677 conditions per place. [2022-12-13 02:11:50,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 175 transitions, 3620 flow [2022-12-13 02:11:50,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 1438 [2022-12-13 02:11:50,851 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:50,852 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-13 02:11:50,852 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 175 transitions, 3620 flow [2022-12-13 02:11:50,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:11:50,852 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:50,852 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:50,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 02:11:50,852 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:50,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:50,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1506139240, now seen corresponding path program 2 times [2022-12-13 02:11:50,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:50,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629099533] [2022-12-13 02:11:50,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:51,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:51,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629099533] [2022-12-13 02:11:51,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629099533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:51,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:51,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 02:11:51,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800831538] [2022-12-13 02:11:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:51,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:11:51,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:11:51,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:11:51,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:11:51,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 175 transitions, 3620 flow. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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) [2022-12-13 02:11:51,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:51,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:11:51,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:52,999 INFO L130 PetriNetUnfolder]: 4843/7407 cut-off events. [2022-12-13 02:11:52,999 INFO L131 PetriNetUnfolder]: For 174680/174680 co-relation queries the response was YES. [2022-12-13 02:11:53,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62526 conditions, 7407 events. 4843/7407 cut-off events. For 174680/174680 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 42261 event pairs, 1455 based on Foata normal form. 38/6137 useless extension candidates. Maximal degree in co-relation 57138. Up to 6942 conditions per place. [2022-12-13 02:11:53,060 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 183 selfloop transitions, 15 changer transitions 22/220 dead transitions. [2022-12-13 02:11:53,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 220 transitions, 4529 flow [2022-12-13 02:11:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-13 02:11:53,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-13 02:11:53,061 INFO L175 Difference]: Start difference. First operand has 131 places, 175 transitions, 3620 flow. Second operand 6 states and 72 transitions. [2022-12-13 02:11:53,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 220 transitions, 4529 flow [2022-12-13 02:11:53,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 220 transitions, 4412 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 02:11:53,354 INFO L231 Difference]: Finished difference. Result has 137 places, 179 transitions, 3627 flow [2022-12-13 02:11:53,354 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3509, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3627, PETRI_PLACES=137, PETRI_TRANSITIONS=179} [2022-12-13 02:11:53,354 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2022-12-13 02:11:53,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:53,355 INFO L89 Accepts]: Start accepts. Operand has 137 places, 179 transitions, 3627 flow [2022-12-13 02:11:53,356 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:53,356 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:53,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 179 transitions, 3627 flow [2022-12-13 02:11:53,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 179 transitions, 3627 flow [2022-12-13 02:11:53,677 INFO L130 PetriNetUnfolder]: 751/1824 cut-off events. [2022-12-13 02:11:53,677 INFO L131 PetriNetUnfolder]: For 32903/33100 co-relation queries the response was YES. [2022-12-13 02:11:53,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14155 conditions, 1824 events. 751/1824 cut-off events. For 32903/33100 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 14239 event pairs, 102 based on Foata normal form. 77/1539 useless extension candidates. Maximal degree in co-relation 13007. Up to 670 conditions per place. [2022-12-13 02:11:53,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 179 transitions, 3627 flow [2022-12-13 02:11:53,820 INFO L226 LiptonReduction]: Number of co-enabled transitions 1460 [2022-12-13 02:11:53,821 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:53,822 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 467 [2022-12-13 02:11:53,822 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 179 transitions, 3627 flow [2022-12-13 02:11:53,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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) [2022-12-13 02:11:53,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:53,822 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:53,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 02:11:53,822 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:53,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2090321848, now seen corresponding path program 3 times [2022-12-13 02:11:53,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:53,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089535101] [2022-12-13 02:11:53,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:53,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:54,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:54,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089535101] [2022-12-13 02:11:54,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089535101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:54,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:54,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 02:11:54,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817966282] [2022-12-13 02:11:54,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:54,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:11:54,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:54,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:11:54,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:11:54,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:11:54,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 179 transitions, 3627 flow. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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) [2022-12-13 02:11:54,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:54,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:11:54,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:56,394 INFO L130 PetriNetUnfolder]: 6856/10379 cut-off events. [2022-12-13 02:11:56,394 INFO L131 PetriNetUnfolder]: For 244703/244703 co-relation queries the response was YES. [2022-12-13 02:11:56,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86968 conditions, 10379 events. 6856/10379 cut-off events. For 244703/244703 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 61396 event pairs, 1187 based on Foata normal form. 33/8544 useless extension candidates. Maximal degree in co-relation 77597. Up to 5807 conditions per place. [2022-12-13 02:11:56,481 INFO L137 encePairwiseOnDemand]: 14/31 looper letters, 186 selfloop transitions, 53 changer transitions 37/276 dead transitions. [2022-12-13 02:11:56,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 276 transitions, 5795 flow [2022-12-13 02:11:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:11:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:11:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-13 02:11:56,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2022-12-13 02:11:56,482 INFO L175 Difference]: Start difference. First operand has 137 places, 179 transitions, 3627 flow. Second operand 6 states and 85 transitions. [2022-12-13 02:11:56,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 276 transitions, 5795 flow [2022-12-13 02:11:56,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 276 transitions, 5577 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:11:56,888 INFO L231 Difference]: Finished difference. Result has 141 places, 195 transitions, 3971 flow [2022-12-13 02:11:56,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3483, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3971, PETRI_PLACES=141, PETRI_TRANSITIONS=195} [2022-12-13 02:11:56,889 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 109 predicate places. [2022-12-13 02:11:56,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:56,889 INFO L89 Accepts]: Start accepts. Operand has 141 places, 195 transitions, 3971 flow [2022-12-13 02:11:56,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:56,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:56,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 195 transitions, 3971 flow [2022-12-13 02:11:56,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 195 transitions, 3971 flow [2022-12-13 02:11:57,327 INFO L130 PetriNetUnfolder]: 1524/3261 cut-off events. [2022-12-13 02:11:57,328 INFO L131 PetriNetUnfolder]: For 58889/58992 co-relation queries the response was YES. [2022-12-13 02:11:57,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26691 conditions, 3261 events. 1524/3261 cut-off events. For 58889/58992 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 25307 event pairs, 118 based on Foata normal form. 33/2584 useless extension candidates. Maximal degree in co-relation 23950. Up to 1190 conditions per place. [2022-12-13 02:11:57,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 195 transitions, 3971 flow [2022-12-13 02:11:57,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 1408 [2022-12-13 02:11:57,369 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:57,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 480 [2022-12-13 02:11:57,369 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 195 transitions, 3971 flow [2022-12-13 02:11:57,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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) [2022-12-13 02:11:57,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:57,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:57,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 02:11:57,370 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:11:57,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1313112205, now seen corresponding path program 1 times [2022-12-13 02:11:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:57,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649585557] [2022-12-13 02:11:57,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:57,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649585557] [2022-12-13 02:11:57,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649585557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:11:57,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:11:57,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:11:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001929877] [2022-12-13 02:11:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:11:57,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:11:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:57,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:11:57,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:11:57,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:11:57,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 195 transitions, 3971 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-12-13 02:11:57,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:57,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:11:57,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:59,692 INFO L130 PetriNetUnfolder]: 6808/10257 cut-off events. [2022-12-13 02:11:59,692 INFO L131 PetriNetUnfolder]: For 245986/245986 co-relation queries the response was YES. [2022-12-13 02:11:59,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91478 conditions, 10257 events. 6808/10257 cut-off events. For 245986/245986 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 60133 event pairs, 1118 based on Foata normal form. 16/8450 useless extension candidates. Maximal degree in co-relation 82136. Up to 5378 conditions per place. [2022-12-13 02:11:59,787 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 173 selfloop transitions, 90 changer transitions 0/263 dead transitions. [2022-12-13 02:11:59,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 263 transitions, 5342 flow [2022-12-13 02:11:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:11:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:11:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-13 02:11:59,788 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3824884792626728 [2022-12-13 02:11:59,788 INFO L175 Difference]: Start difference. First operand has 135 places, 195 transitions, 3971 flow. Second operand 7 states and 83 transitions. [2022-12-13 02:11:59,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 263 transitions, 5342 flow [2022-12-13 02:12:00,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 263 transitions, 5060 flow, removed 75 selfloop flow, removed 6 redundant places. [2022-12-13 02:12:00,407 INFO L231 Difference]: Finished difference. Result has 139 places, 209 transitions, 4442 flow [2022-12-13 02:12:00,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3789, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4442, PETRI_PLACES=139, PETRI_TRANSITIONS=209} [2022-12-13 02:12:00,407 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 107 predicate places. [2022-12-13 02:12:00,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:12:00,407 INFO L89 Accepts]: Start accepts. Operand has 139 places, 209 transitions, 4442 flow [2022-12-13 02:12:00,409 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:12:00,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:12:00,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 209 transitions, 4442 flow [2022-12-13 02:12:00,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 209 transitions, 4442 flow [2022-12-13 02:12:00,741 INFO L130 PetriNetUnfolder]: 1529/3222 cut-off events. [2022-12-13 02:12:00,741 INFO L131 PetriNetUnfolder]: For 61593/61646 co-relation queries the response was YES. [2022-12-13 02:12:00,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25262 conditions, 3222 events. 1529/3222 cut-off events. For 61593/61646 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 24474 event pairs, 99 based on Foata normal form. 33/2530 useless extension candidates. Maximal degree in co-relation 22666. Up to 1219 conditions per place. [2022-12-13 02:12:00,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 209 transitions, 4442 flow [2022-12-13 02:12:00,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 1432 [2022-12-13 02:12:00,792 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:12:00,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 386 [2022-12-13 02:12:00,793 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 209 transitions, 4442 flow [2022-12-13 02:12:00,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-12-13 02:12:00,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:00,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:00,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 02:12:00,793 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:12:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1014147493, now seen corresponding path program 2 times [2022-12-13 02:12:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:00,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226944611] [2022-12-13 02:12:00,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:00,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:01,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:01,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226944611] [2022-12-13 02:12:01,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226944611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:12:01,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:12:01,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:12:01,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781598927] [2022-12-13 02:12:01,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:12:01,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:12:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:12:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:12:01,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:12:01,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 209 transitions, 4442 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:01,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:01,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:12:01,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:02,818 INFO L130 PetriNetUnfolder]: 6860/10337 cut-off events. [2022-12-13 02:12:02,818 INFO L131 PetriNetUnfolder]: For 271689/271689 co-relation queries the response was YES. [2022-12-13 02:12:02,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89567 conditions, 10337 events. 6860/10337 cut-off events. For 271689/271689 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 61092 event pairs, 969 based on Foata normal form. 14/8518 useless extension candidates. Maximal degree in co-relation 79721. Up to 4957 conditions per place. [2022-12-13 02:12:02,947 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 158 selfloop transitions, 97 changer transitions 0/255 dead transitions. [2022-12-13 02:12:02,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 255 transitions, 5407 flow [2022-12-13 02:12:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:12:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:12:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-13 02:12:02,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33640552995391704 [2022-12-13 02:12:02,948 INFO L175 Difference]: Start difference. First operand has 139 places, 209 transitions, 4442 flow. Second operand 7 states and 73 transitions. [2022-12-13 02:12:02,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 255 transitions, 5407 flow [2022-12-13 02:12:03,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 255 transitions, 5317 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 02:12:03,470 INFO L231 Difference]: Finished difference. Result has 145 places, 211 transitions, 4750 flow [2022-12-13 02:12:03,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=4353, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4750, PETRI_PLACES=145, PETRI_TRANSITIONS=211} [2022-12-13 02:12:03,471 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 113 predicate places. [2022-12-13 02:12:03,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:12:03,471 INFO L89 Accepts]: Start accepts. Operand has 145 places, 211 transitions, 4750 flow [2022-12-13 02:12:03,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:12:03,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:12:03,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 211 transitions, 4750 flow [2022-12-13 02:12:03,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 211 transitions, 4750 flow [2022-12-13 02:12:03,987 INFO L130 PetriNetUnfolder]: 1539/3312 cut-off events. [2022-12-13 02:12:03,987 INFO L131 PetriNetUnfolder]: For 72168/72255 co-relation queries the response was YES. [2022-12-13 02:12:04,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26493 conditions, 3312 events. 1539/3312 cut-off events. For 72168/72255 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 25811 event pairs, 113 based on Foata normal form. 55/2653 useless extension candidates. Maximal degree in co-relation 23601. Up to 1223 conditions per place. [2022-12-13 02:12:04,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 211 transitions, 4750 flow [2022-12-13 02:12:04,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 1452 [2022-12-13 02:12:07,757 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:12:07,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4286 [2022-12-13 02:12:07,758 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 211 transitions, 4760 flow [2022-12-13 02:12:07,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:07,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:07,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:07,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 02:12:07,758 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:12:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1669713301, now seen corresponding path program 3 times [2022-12-13 02:12:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:07,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081056511] [2022-12-13 02:12:07,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:08,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081056511] [2022-12-13 02:12:08,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081056511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:12:08,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:12:08,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:12:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408930734] [2022-12-13 02:12:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:12:08,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:12:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:12:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:12:08,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:12:08,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 211 transitions, 4760 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:08,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:08,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:12:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:10,165 INFO L130 PetriNetUnfolder]: 6999/10556 cut-off events. [2022-12-13 02:12:10,165 INFO L131 PetriNetUnfolder]: For 321948/321948 co-relation queries the response was YES. [2022-12-13 02:12:10,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95384 conditions, 10556 events. 6999/10556 cut-off events. For 321948/321948 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 62654 event pairs, 1220 based on Foata normal form. 32/8721 useless extension candidates. Maximal degree in co-relation 85349. Up to 5696 conditions per place. [2022-12-13 02:12:10,240 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 169 selfloop transitions, 91 changer transitions 9/269 dead transitions. [2022-12-13 02:12:10,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 269 transitions, 6007 flow [2022-12-13 02:12:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:12:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:12:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-13 02:12:10,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2022-12-13 02:12:10,241 INFO L175 Difference]: Start difference. First operand has 145 places, 211 transitions, 4760 flow. Second operand 7 states and 79 transitions. [2022-12-13 02:12:10,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 269 transitions, 6007 flow [2022-12-13 02:12:10,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 269 transitions, 5787 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 02:12:10,835 INFO L231 Difference]: Finished difference. Result has 149 places, 220 transitions, 5132 flow [2022-12-13 02:12:10,835 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4554, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5132, PETRI_PLACES=149, PETRI_TRANSITIONS=220} [2022-12-13 02:12:10,835 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 117 predicate places. [2022-12-13 02:12:10,835 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:12:10,836 INFO L89 Accepts]: Start accepts. Operand has 149 places, 220 transitions, 5132 flow [2022-12-13 02:12:10,837 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:12:10,837 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:12:10,837 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 220 transitions, 5132 flow [2022-12-13 02:12:10,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 220 transitions, 5132 flow [2022-12-13 02:12:11,290 INFO L130 PetriNetUnfolder]: 1563/3355 cut-off events. [2022-12-13 02:12:11,290 INFO L131 PetriNetUnfolder]: For 82469/82552 co-relation queries the response was YES. [2022-12-13 02:12:11,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27702 conditions, 3355 events. 1563/3355 cut-off events. For 82469/82552 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 26206 event pairs, 114 based on Foata normal form. 59/2693 useless extension candidates. Maximal degree in co-relation 24110. Up to 1235 conditions per place. [2022-12-13 02:12:11,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 220 transitions, 5132 flow [2022-12-13 02:12:11,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-13 02:12:11,334 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:12:11,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 500 [2022-12-13 02:12:11,335 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 220 transitions, 5132 flow [2022-12-13 02:12:11,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:11,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:11,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:11,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 02:12:11,335 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:12:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1298874388, now seen corresponding path program 1 times [2022-12-13 02:12:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:11,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634008209] [2022-12-13 02:12:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:12,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:12,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634008209] [2022-12-13 02:12:12,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634008209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:12:12,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:12:12,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:12:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043975427] [2022-12-13 02:12:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:12:12,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:12:12,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:12,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:12:12,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:12:12,007 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:12:12,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 220 transitions, 5132 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:12,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:12,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:12:12,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:13,672 INFO L130 PetriNetUnfolder]: 7127/10736 cut-off events. [2022-12-13 02:12:13,673 INFO L131 PetriNetUnfolder]: For 353215/353215 co-relation queries the response was YES. [2022-12-13 02:12:13,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99739 conditions, 10736 events. 7127/10736 cut-off events. For 353215/353215 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 63898 event pairs, 742 based on Foata normal form. 16/8858 useless extension candidates. Maximal degree in co-relation 89395. Up to 5178 conditions per place. [2022-12-13 02:12:13,754 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 166 selfloop transitions, 109 changer transitions 0/275 dead transitions. [2022-12-13 02:12:13,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 275 transitions, 6302 flow [2022-12-13 02:12:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:12:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:12:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-13 02:12:13,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2022-12-13 02:12:13,760 INFO L175 Difference]: Start difference. First operand has 148 places, 220 transitions, 5132 flow. Second operand 6 states and 74 transitions. [2022-12-13 02:12:13,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 275 transitions, 6302 flow [2022-12-13 02:12:14,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 275 transitions, 6174 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 02:12:14,471 INFO L231 Difference]: Finished difference. Result has 153 places, 226 transitions, 5596 flow [2022-12-13 02:12:14,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5014, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5596, PETRI_PLACES=153, PETRI_TRANSITIONS=226} [2022-12-13 02:12:14,471 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 121 predicate places. [2022-12-13 02:12:14,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:12:14,471 INFO L89 Accepts]: Start accepts. Operand has 153 places, 226 transitions, 5596 flow [2022-12-13 02:12:14,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:12:14,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:12:14,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 226 transitions, 5596 flow [2022-12-13 02:12:14,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 226 transitions, 5596 flow [2022-12-13 02:12:14,913 INFO L130 PetriNetUnfolder]: 1578/3404 cut-off events. [2022-12-13 02:12:14,913 INFO L131 PetriNetUnfolder]: For 94433/94514 co-relation queries the response was YES. [2022-12-13 02:12:14,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29130 conditions, 3404 events. 1578/3404 cut-off events. For 94433/94514 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 26812 event pairs, 118 based on Foata normal form. 57/2741 useless extension candidates. Maximal degree in co-relation 26070. Up to 1262 conditions per place. [2022-12-13 02:12:14,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 226 transitions, 5596 flow [2022-12-13 02:12:14,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 1564 [2022-12-13 02:12:14,962 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:12:14,963 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 492 [2022-12-13 02:12:14,963 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 226 transitions, 5596 flow [2022-12-13 02:12:14,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:14,963 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:14,963 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:14,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 02:12:14,964 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:12:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1982836673, now seen corresponding path program 4 times [2022-12-13 02:12:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:14,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887979518] [2022-12-13 02:12:14,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:15,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:15,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887979518] [2022-12-13 02:12:15,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887979518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:12:15,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:12:15,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:12:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428455406] [2022-12-13 02:12:15,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:12:15,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:12:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:15,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:12:15,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:12:15,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:12:15,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 226 transitions, 5596 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:15,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:15,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:12:15,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:17,345 INFO L130 PetriNetUnfolder]: 7067/10604 cut-off events. [2022-12-13 02:12:17,345 INFO L131 PetriNetUnfolder]: For 421258/421258 co-relation queries the response was YES. [2022-12-13 02:12:17,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102894 conditions, 10604 events. 7067/10604 cut-off events. For 421258/421258 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 62255 event pairs, 1315 based on Foata normal form. 28/8778 useless extension candidates. Maximal degree in co-relation 92793. Up to 5415 conditions per place. [2022-12-13 02:12:17,611 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 163 selfloop transitions, 106 changer transitions 1/270 dead transitions. [2022-12-13 02:12:17,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 270 transitions, 6636 flow [2022-12-13 02:12:17,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:12:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:12:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 02:12:17,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2022-12-13 02:12:17,612 INFO L175 Difference]: Start difference. First operand has 153 places, 226 transitions, 5596 flow. Second operand 6 states and 71 transitions. [2022-12-13 02:12:17,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 270 transitions, 6636 flow [2022-12-13 02:12:18,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 270 transitions, 6525 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-12-13 02:12:18,230 INFO L231 Difference]: Finished difference. Result has 158 places, 229 transitions, 5842 flow [2022-12-13 02:12:18,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5499, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5842, PETRI_PLACES=158, PETRI_TRANSITIONS=229} [2022-12-13 02:12:18,231 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 126 predicate places. [2022-12-13 02:12:18,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:12:18,231 INFO L89 Accepts]: Start accepts. Operand has 158 places, 229 transitions, 5842 flow [2022-12-13 02:12:18,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:12:18,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:12:18,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 229 transitions, 5842 flow [2022-12-13 02:12:18,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 229 transitions, 5842 flow [2022-12-13 02:12:18,605 INFO L130 PetriNetUnfolder]: 1578/3373 cut-off events. [2022-12-13 02:12:18,605 INFO L131 PetriNetUnfolder]: For 96877/96958 co-relation queries the response was YES. [2022-12-13 02:12:18,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28925 conditions, 3373 events. 1578/3373 cut-off events. For 96877/96958 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 26230 event pairs, 121 based on Foata normal form. 57/2722 useless extension candidates. Maximal degree in co-relation 25909. Up to 1262 conditions per place. [2022-12-13 02:12:18,651 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 229 transitions, 5842 flow [2022-12-13 02:12:18,651 INFO L226 LiptonReduction]: Number of co-enabled transitions 1578 [2022-12-13 02:12:18,653 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:12:18,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 422 [2022-12-13 02:12:18,653 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 229 transitions, 5842 flow [2022-12-13 02:12:18,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:18,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:18,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:18,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 02:12:18,654 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:12:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2088699318, now seen corresponding path program 2 times [2022-12-13 02:12:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:18,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730138910] [2022-12-13 02:12:18,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:19,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:19,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730138910] [2022-12-13 02:12:19,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730138910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:12:19,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:12:19,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:12:19,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536560909] [2022-12-13 02:12:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:12:19,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:12:19,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:12:19,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:12:19,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:12:19,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 229 transitions, 5842 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:19,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:19,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:12:19,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:21,522 INFO L130 PetriNetUnfolder]: 8153/12267 cut-off events. [2022-12-13 02:12:21,522 INFO L131 PetriNetUnfolder]: For 503761/503761 co-relation queries the response was YES. [2022-12-13 02:12:21,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121108 conditions, 12267 events. 8153/12267 cut-off events. For 503761/503761 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 74001 event pairs, 1319 based on Foata normal form. 32/10252 useless extension candidates. Maximal degree in co-relation 110443. Up to 6209 conditions per place. [2022-12-13 02:12:21,803 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 214 selfloop transitions, 138 changer transitions 1/353 dead transitions. [2022-12-13 02:12:21,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 353 transitions, 9183 flow [2022-12-13 02:12:21,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:12:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:12:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-12-13 02:12:21,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-13 02:12:21,805 INFO L175 Difference]: Start difference. First operand has 157 places, 229 transitions, 5842 flow. Second operand 7 states and 80 transitions. [2022-12-13 02:12:21,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 353 transitions, 9183 flow [2022-12-13 02:12:22,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 353 transitions, 8631 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-12-13 02:12:22,594 INFO L231 Difference]: Finished difference. Result has 161 places, 299 transitions, 8051 flow [2022-12-13 02:12:22,594 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5438, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8051, PETRI_PLACES=161, PETRI_TRANSITIONS=299} [2022-12-13 02:12:22,594 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 129 predicate places. [2022-12-13 02:12:22,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:12:22,595 INFO L89 Accepts]: Start accepts. Operand has 161 places, 299 transitions, 8051 flow [2022-12-13 02:12:22,597 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:12:22,597 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:12:22,597 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 299 transitions, 8051 flow [2022-12-13 02:12:22,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 299 transitions, 8051 flow [2022-12-13 02:12:23,060 INFO L130 PetriNetUnfolder]: 1806/3872 cut-off events. [2022-12-13 02:12:23,060 INFO L131 PetriNetUnfolder]: For 112886/112990 co-relation queries the response was YES. [2022-12-13 02:12:23,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34052 conditions, 3872 events. 1806/3872 cut-off events. For 112886/112990 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 31045 event pairs, 154 based on Foata normal form. 76/3173 useless extension candidates. Maximal degree in co-relation 31004. Up to 1504 conditions per place. [2022-12-13 02:12:23,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 299 transitions, 8051 flow [2022-12-13 02:12:23,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 2000 [2022-12-13 02:12:23,121 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:12:23,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 528 [2022-12-13 02:12:23,122 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 299 transitions, 8051 flow [2022-12-13 02:12:23,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-12-13 02:12:23,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:23,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:23,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 02:12:23,122 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:12:23,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1570247582, now seen corresponding path program 3 times [2022-12-13 02:12:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:23,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389886427] [2022-12-13 02:12:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:23,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389886427] [2022-12-13 02:12:23,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389886427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:12:23,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:12:23,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:12:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581072325] [2022-12-13 02:12:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:12:23,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:12:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:23,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:12:23,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:12:23,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:12:23,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 299 transitions, 8051 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-12-13 02:12:23,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:23,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:12:23,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:25,775 INFO L130 PetriNetUnfolder]: 8203/12329 cut-off events. [2022-12-13 02:12:25,775 INFO L131 PetriNetUnfolder]: For 490853/490853 co-relation queries the response was YES. [2022-12-13 02:12:25,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122196 conditions, 12329 events. 8203/12329 cut-off events. For 490853/490853 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 74254 event pairs, 995 based on Foata normal form. 40/10380 useless extension candidates. Maximal degree in co-relation 111919. Up to 7317 conditions per place. [2022-12-13 02:12:25,886 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 264 selfloop transitions, 90 changer transitions 1/355 dead transitions. [2022-12-13 02:12:25,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 355 transitions, 9320 flow [2022-12-13 02:12:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:12:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:12:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-13 02:12:25,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4114583333333333 [2022-12-13 02:12:25,887 INFO L175 Difference]: Start difference. First operand has 161 places, 299 transitions, 8051 flow. Second operand 6 states and 79 transitions. [2022-12-13 02:12:25,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 355 transitions, 9320 flow [2022-12-13 02:12:26,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 355 transitions, 9306 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 02:12:26,770 INFO L231 Difference]: Finished difference. Result has 169 places, 299 transitions, 8381 flow [2022-12-13 02:12:26,770 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8003, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8381, PETRI_PLACES=169, PETRI_TRANSITIONS=299} [2022-12-13 02:12:26,771 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 137 predicate places. [2022-12-13 02:12:26,771 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:12:26,771 INFO L89 Accepts]: Start accepts. Operand has 169 places, 299 transitions, 8381 flow [2022-12-13 02:12:26,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:12:26,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:12:26,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 299 transitions, 8381 flow [2022-12-13 02:12:26,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 299 transitions, 8381 flow [2022-12-13 02:12:27,344 INFO L130 PetriNetUnfolder]: 1803/3852 cut-off events. [2022-12-13 02:12:27,344 INFO L131 PetriNetUnfolder]: For 131885/132010 co-relation queries the response was YES. [2022-12-13 02:12:27,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35644 conditions, 3852 events. 1803/3852 cut-off events. For 131885/132010 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 30838 event pairs, 142 based on Foata normal form. 76/3166 useless extension candidates. Maximal degree in co-relation 32566. Up to 1485 conditions per place. [2022-12-13 02:12:27,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 299 transitions, 8381 flow [2022-12-13 02:12:27,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 2010 [2022-12-13 02:12:27,403 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:12:27,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 632 [2022-12-13 02:12:27,404 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 299 transitions, 8381 flow [2022-12-13 02:12:27,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-12-13 02:12:27,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:27,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:27,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 02:12:27,404 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:12:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1044024571, now seen corresponding path program 1 times [2022-12-13 02:12:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:27,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324090959] [2022-12-13 02:12:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:27,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324090959] [2022-12-13 02:12:27,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324090959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:12:27,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747097376] [2022-12-13 02:12:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:27,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:12:27,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:12:27,685 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) [2022-12-13 02:12:27,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 02:12:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:27,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 02:12:27,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:12:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:28,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:12:28,053 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 02:12:28,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 15 [2022-12-13 02:12:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:28,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747097376] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:12:28,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:12:28,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2022-12-13 02:12:28,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074997563] [2022-12-13 02:12:28,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:12:28,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:12:28,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:28,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:12:28,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:12:28,148 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:12:28,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 299 transitions, 8381 flow. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 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) [2022-12-13 02:12:28,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:28,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:12:28,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:33,531 INFO L130 PetriNetUnfolder]: 17267/25967 cut-off events. [2022-12-13 02:12:33,531 INFO L131 PetriNetUnfolder]: For 1187826/1187826 co-relation queries the response was YES. [2022-12-13 02:12:33,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264791 conditions, 25967 events. 17267/25967 cut-off events. For 1187826/1187826 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 171614 event pairs, 2808 based on Foata normal form. 0/21901 useless extension candidates. Maximal degree in co-relation 233526. Up to 7005 conditions per place. [2022-12-13 02:12:33,885 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 606 selfloop transitions, 174 changer transitions 2/782 dead transitions. [2022-12-13 02:12:33,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 782 transitions, 19722 flow [2022-12-13 02:12:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 02:12:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 02:12:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 206 transitions. [2022-12-13 02:12:33,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2022-12-13 02:12:33,887 INFO L175 Difference]: Start difference. First operand has 169 places, 299 transitions, 8381 flow. Second operand 17 states and 206 transitions. [2022-12-13 02:12:33,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 782 transitions, 19722 flow [2022-12-13 02:12:36,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 782 transitions, 19633 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 02:12:36,560 INFO L231 Difference]: Finished difference. Result has 192 places, 427 transitions, 11841 flow [2022-12-13 02:12:36,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8307, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=11841, PETRI_PLACES=192, PETRI_TRANSITIONS=427} [2022-12-13 02:12:36,561 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 160 predicate places. [2022-12-13 02:12:36,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:12:36,561 INFO L89 Accepts]: Start accepts. Operand has 192 places, 427 transitions, 11841 flow [2022-12-13 02:12:36,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:12:36,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:12:36,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 427 transitions, 11841 flow [2022-12-13 02:12:36,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 427 transitions, 11841 flow [2022-12-13 02:12:37,882 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][409], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 869#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, 47#L129-4true, Black: 770#true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 268#(<= ~n2~0 (+ 1 ~q2_front~0)), Black: 404#(or (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 1)), Black: 275#(and (<= ~n2~0 (+ 1 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (<= 0 ~q2_front~0)) (<= ~q2_back~0 ~q2_front~0))), Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 845#true, Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 421#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 296#true, Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 679#(and (= ~q1~0.offset 0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)))), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 831#(not (= |thread2Thread1of1ForFork2_~j~0#1| 0)), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), 353#true, Black: 717#(or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 848#(and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1)) (and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 852#(not (= |thread2Thread1of1ForFork2_~j~0#1| 0)), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), 797#true, 409#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 865#(and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 864#(or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), Black: 233#(<= ~q1_back~0 ~q1_front~0), 311#true, 859#true, Black: 744#(and (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 748#(not (= |thread2Thread1of1ForFork2_~j~0#1| 0)), Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0)), Black: 871#(and (<= ~q2_front~0 ~q2_back~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q2_back~0 ~q2_front~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))]) [2022-12-13 02:12:37,883 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 02:12:37,883 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 02:12:37,883 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 02:12:37,883 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 02:12:37,884 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][409], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 869#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, 47#L129-4true, Black: 770#true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 268#(<= ~n2~0 (+ 1 ~q2_front~0)), Black: 404#(or (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 1)), Black: 275#(and (<= ~n2~0 (+ 1 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (<= 0 ~q2_front~0)) (<= ~q2_back~0 ~q2_front~0))), Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 845#true, Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 421#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 296#true, Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 679#(and (= ~q1~0.offset 0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)))), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 831#(not (= |thread2Thread1of1ForFork2_~j~0#1| 0)), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), 353#true, Black: 717#(or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 848#(and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1)) (and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 852#(not (= |thread2Thread1of1ForFork2_~j~0#1| 0)), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), 797#true, 409#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 865#(and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 864#(or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), Black: 233#(<= ~q1_back~0 ~q1_front~0), 311#true, 859#true, Black: 744#(and (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 748#(not (= |thread2Thread1of1ForFork2_~j~0#1| 0)), Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0)), Black: 871#(and (<= ~q2_front~0 ~q2_back~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q2_back~0 ~q2_front~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))]) [2022-12-13 02:12:37,885 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 02:12:37,885 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 02:12:37,885 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 02:12:37,885 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 02:12:37,930 INFO L130 PetriNetUnfolder]: 3864/8104 cut-off events. [2022-12-13 02:12:37,930 INFO L131 PetriNetUnfolder]: For 308074/308613 co-relation queries the response was YES. [2022-12-13 02:12:37,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79171 conditions, 8104 events. 3864/8104 cut-off events. For 308074/308613 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 71222 event pairs, 190 based on Foata normal form. 230/6945 useless extension candidates. Maximal degree in co-relation 74312. Up to 2916 conditions per place. [2022-12-13 02:12:38,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 427 transitions, 11841 flow [2022-12-13 02:12:38,061 INFO L226 LiptonReduction]: Number of co-enabled transitions 2902 [2022-12-13 02:12:38,063 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:12:38,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1502 [2022-12-13 02:12:38,063 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 427 transitions, 11841 flow [2022-12-13 02:12:38,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 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) [2022-12-13 02:12:38,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:38,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:38,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 02:12:38,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:12:38,265 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:12:38,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 42326190, now seen corresponding path program 1 times [2022-12-13 02:12:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:38,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550845864] [2022-12-13 02:12:38,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:12:38,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:38,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550845864] [2022-12-13 02:12:38,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550845864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:12:38,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:12:38,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:12:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707208624] [2022-12-13 02:12:38,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:12:38,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:12:38,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:38,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:12:38,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:12:38,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:12:38,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 427 transitions, 11841 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) [2022-12-13 02:12:38,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:38,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:12:38,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:12:45,079 INFO L130 PetriNetUnfolder]: 18597/27893 cut-off events. [2022-12-13 02:12:45,079 INFO L131 PetriNetUnfolder]: For 1432085/1432085 co-relation queries the response was YES. [2022-12-13 02:12:45,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299585 conditions, 27893 events. 18597/27893 cut-off events. For 1432085/1432085 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 186508 event pairs, 2301 based on Foata normal form. 32/24369 useless extension candidates. Maximal degree in co-relation 285625. Up to 11118 conditions per place. [2022-12-13 02:12:45,552 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 328 selfloop transitions, 205 changer transitions 4/537 dead transitions. [2022-12-13 02:12:45,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 537 transitions, 14936 flow [2022-12-13 02:12:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:12:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:12:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-13 02:12:45,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-13 02:12:45,554 INFO L175 Difference]: Start difference. First operand has 192 places, 427 transitions, 11841 flow. Second operand 7 states and 88 transitions. [2022-12-13 02:12:45,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 537 transitions, 14936 flow [2022-12-13 02:12:50,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 537 transitions, 14666 flow, removed 135 selfloop flow, removed 0 redundant places. [2022-12-13 02:12:50,482 INFO L231 Difference]: Finished difference. Result has 199 places, 452 transitions, 13179 flow [2022-12-13 02:12:50,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11619, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13179, PETRI_PLACES=199, PETRI_TRANSITIONS=452} [2022-12-13 02:12:50,483 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2022-12-13 02:12:50,483 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:12:50,483 INFO L89 Accepts]: Start accepts. Operand has 199 places, 452 transitions, 13179 flow [2022-12-13 02:12:50,486 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:12:50,486 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:12:50,486 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 452 transitions, 13179 flow [2022-12-13 02:12:50,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 452 transitions, 13179 flow [2022-12-13 02:12:51,941 INFO L130 PetriNetUnfolder]: 4193/8796 cut-off events. [2022-12-13 02:12:51,941 INFO L131 PetriNetUnfolder]: For 352537/352775 co-relation queries the response was YES. [2022-12-13 02:12:51,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86571 conditions, 8796 events. 4193/8796 cut-off events. For 352537/352775 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 78841 event pairs, 215 based on Foata normal form. 149/7472 useless extension candidates. Maximal degree in co-relation 81802. Up to 3125 conditions per place. [2022-12-13 02:12:52,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 452 transitions, 13179 flow [2022-12-13 02:12:52,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 3160 [2022-12-13 02:12:52,117 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:12:52,117 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1634 [2022-12-13 02:12:52,117 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 452 transitions, 13179 flow [2022-12-13 02:12:52,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) [2022-12-13 02:12:52,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:12:52,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:12:52,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 02:12:52,119 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:12:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:12:52,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2044577116, now seen corresponding path program 1 times [2022-12-13 02:12:52,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:12:52,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28368804] [2022-12-13 02:12:52,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:52,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:12:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:12:52,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:12:52,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28368804] [2022-12-13 02:12:52,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28368804] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:12:52,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65553739] [2022-12-13 02:12:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:12:52,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:12:52,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:12:52,801 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) [2022-12-13 02:12:52,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 02:12:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:12:52,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 02:12:52,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:12:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:12:53,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 02:12:53,072 INFO L350 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 23 treesize of output 7 [2022-12-13 02:12:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:12:53,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:12:53,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65553739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:12:53,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:12:53,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-13 02:12:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193321934] [2022-12-13 02:12:53,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:12:53,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:12:53,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:12:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:12:53,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-13 02:12:53,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:12:53,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 452 transitions, 13179 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) [2022-12-13 02:12:53,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:12:53,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:12:53,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:13:00,013 INFO L130 PetriNetUnfolder]: 19419/29122 cut-off events. [2022-12-13 02:13:00,013 INFO L131 PetriNetUnfolder]: For 1590842/1590842 co-relation queries the response was YES. [2022-12-13 02:13:00,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318079 conditions, 29122 events. 19419/29122 cut-off events. For 1590842/1590842 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 196094 event pairs, 3910 based on Foata normal form. 66/25405 useless extension candidates. Maximal degree in co-relation 304397. Up to 20157 conditions per place. [2022-12-13 02:13:00,573 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 453 selfloop transitions, 84 changer transitions 0/537 dead transitions. [2022-12-13 02:13:00,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 537 transitions, 15778 flow [2022-12-13 02:13:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:13:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:13:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-13 02:13:00,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-13 02:13:00,574 INFO L175 Difference]: Start difference. First operand has 198 places, 452 transitions, 13179 flow. Second operand 6 states and 70 transitions. [2022-12-13 02:13:00,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 537 transitions, 15778 flow [2022-12-13 02:13:05,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 537 transitions, 14770 flow, removed 43 selfloop flow, removed 10 redundant places. [2022-12-13 02:13:05,658 INFO L231 Difference]: Finished difference. Result has 195 places, 462 transitions, 12921 flow [2022-12-13 02:13:05,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12271, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12921, PETRI_PLACES=195, PETRI_TRANSITIONS=462} [2022-12-13 02:13:05,659 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2022-12-13 02:13:05,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:13:05,659 INFO L89 Accepts]: Start accepts. Operand has 195 places, 462 transitions, 12921 flow [2022-12-13 02:13:05,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:13:05,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:13:05,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 462 transitions, 12921 flow [2022-12-13 02:13:05,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 462 transitions, 12921 flow [2022-12-13 02:13:07,253 INFO L130 PetriNetUnfolder]: 4315/9096 cut-off events. [2022-12-13 02:13:07,253 INFO L131 PetriNetUnfolder]: For 321674/321945 co-relation queries the response was YES. [2022-12-13 02:13:07,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83695 conditions, 9096 events. 4315/9096 cut-off events. For 321674/321945 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 82298 event pairs, 234 based on Foata normal form. 178/7757 useless extension candidates. Maximal degree in co-relation 79150. Up to 3227 conditions per place. [2022-12-13 02:13:07,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 462 transitions, 12921 flow [2022-12-13 02:13:07,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 3272 [2022-12-13 02:13:07,404 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:13:07,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1745 [2022-12-13 02:13:07,404 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 462 transitions, 12921 flow [2022-12-13 02:13:07,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) [2022-12-13 02:13:07,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:13:07,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:13:07,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 02:13:07,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:13:07,605 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:13:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:13:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1890525560, now seen corresponding path program 2 times [2022-12-13 02:13:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:13:07,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084232767] [2022-12-13 02:13:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:13:07,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:13:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:13:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:13:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:13:08,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084232767] [2022-12-13 02:13:08,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084232767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:13:08,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389815911] [2022-12-13 02:13:08,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:13:08,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:13:08,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:13:08,614 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) [2022-12-13 02:13:08,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 02:13:08,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 02:13:08,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:13:08,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 02:13:08,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:13:08,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:13:08,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 02:13:08,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:13:08,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 02:13:08,935 INFO L350 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 23 treesize of output 7 [2022-12-13 02:13:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:13:08,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:13:08,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389815911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:13:08,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:13:08,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-12-13 02:13:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028395369] [2022-12-13 02:13:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:13:08,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:13:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:13:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:13:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-12-13 02:13:08,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 02:13:08,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 462 transitions, 12921 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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) [2022-12-13 02:13:08,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:13:08,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 02:13:08,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:13:15,207 INFO L130 PetriNetUnfolder]: 19227/28802 cut-off events. [2022-12-13 02:13:15,207 INFO L131 PetriNetUnfolder]: For 1388956/1388956 co-relation queries the response was YES. [2022-12-13 02:13:15,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295319 conditions, 28802 events. 19227/28802 cut-off events. For 1388956/1388956 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 192921 event pairs, 2040 based on Foata normal form. 76/25135 useless extension candidates. Maximal degree in co-relation 283241. Up to 13875 conditions per place. [2022-12-13 02:13:15,527 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 401 selfloop transitions, 108 changer transitions 1/510 dead transitions. [2022-12-13 02:13:15,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 510 transitions, 14562 flow [2022-12-13 02:13:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:13:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:13:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-13 02:13:15,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 02:13:15,529 INFO L175 Difference]: Start difference. First operand has 195 places, 462 transitions, 12921 flow. Second operand 6 states and 68 transitions. [2022-12-13 02:13:15,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 510 transitions, 14562 flow [2022-12-13 02:13:19,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 510 transitions, 14119 flow, removed 121 selfloop flow, removed 7 redundant places. [2022-12-13 02:13:19,475 INFO L231 Difference]: Finished difference. Result has 191 places, 460 transitions, 12919 flow [2022-12-13 02:13:19,475 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12465, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12919, PETRI_PLACES=191, PETRI_TRANSITIONS=460} [2022-12-13 02:13:19,475 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2022-12-13 02:13:19,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:13:19,475 INFO L89 Accepts]: Start accepts. Operand has 191 places, 460 transitions, 12919 flow [2022-12-13 02:13:19,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:13:19,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:13:19,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 460 transitions, 12919 flow [2022-12-13 02:13:19,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 460 transitions, 12919 flow [2022-12-13 02:13:20,863 INFO L130 PetriNetUnfolder]: 4188/8819 cut-off events. [2022-12-13 02:13:20,863 INFO L131 PetriNetUnfolder]: For 324484/324800 co-relation queries the response was YES. [2022-12-13 02:13:20,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78412 conditions, 8819 events. 4188/8819 cut-off events. For 324484/324800 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 79172 event pairs, 223 based on Foata normal form. 232/7587 useless extension candidates. Maximal degree in co-relation 74543. Up to 3084 conditions per place. [2022-12-13 02:13:21,009 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 460 transitions, 12919 flow [2022-12-13 02:13:21,009 INFO L226 LiptonReduction]: Number of co-enabled transitions 3288 [2022-12-13 02:13:21,027 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:13:21,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1553 [2022-12-13 02:13:21,028 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 460 transitions, 12919 flow [2022-12-13 02:13:21,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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) [2022-12-13 02:13:21,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:13:21,029 INFO L214 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] [2022-12-13 02:13:21,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 02:13:21,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:13:21,231 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:13:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:13:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1162192970, now seen corresponding path program 1 times [2022-12-13 02:13:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:13:21,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622337010] [2022-12-13 02:13:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:13:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:13:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:13:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:13:21,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:13:21,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622337010] [2022-12-13 02:13:21,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622337010] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:13:21,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892375536] [2022-12-13 02:13:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:13:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:13:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:13:21,704 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) [2022-12-13 02:13:21,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 02:13:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:13:21,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 02:13:21,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:13:21,906 INFO L350 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 827 treesize of output 817 [2022-12-13 02:13:22,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 02:13:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:13:22,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:13:22,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:13:22,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 40 [2022-12-13 02:13:22,214 INFO L350 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 24 treesize of output 18 [2022-12-13 02:13:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:13:22,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892375536] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:13:22,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:13:22,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2022-12-13 02:13:22,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094639723] [2022-12-13 02:13:22,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:13:22,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 02:13:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:13:22,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 02:13:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-12-13 02:13:22,344 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:13:22,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 460 transitions, 12919 flow. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 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) [2022-12-13 02:13:22,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:13:22,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:13:22,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:13:33,740 INFO L130 PetriNetUnfolder]: 30846/46114 cut-off events. [2022-12-13 02:13:33,740 INFO L131 PetriNetUnfolder]: For 2151425/2151425 co-relation queries the response was YES. [2022-12-13 02:13:34,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453486 conditions, 46114 events. 30846/46114 cut-off events. For 2151425/2151425 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 319816 event pairs, 5586 based on Foata normal form. 674/40954 useless extension candidates. Maximal degree in co-relation 432820. Up to 18958 conditions per place. [2022-12-13 02:13:34,468 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 965 selfloop transitions, 266 changer transitions 2/1233 dead transitions. [2022-12-13 02:13:34,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 1233 transitions, 32656 flow [2022-12-13 02:13:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 02:13:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 02:13:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 235 transitions. [2022-12-13 02:13:34,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2022-12-13 02:13:34,469 INFO L175 Difference]: Start difference. First operand has 190 places, 460 transitions, 12919 flow. Second operand 20 states and 235 transitions. [2022-12-13 02:13:34,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 1233 transitions, 32656 flow [2022-12-13 02:13:41,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1233 transitions, 32299 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-13 02:13:41,863 INFO L231 Difference]: Finished difference. Result has 217 places, 661 transitions, 18435 flow [2022-12-13 02:13:41,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=12756, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=18435, PETRI_PLACES=217, PETRI_TRANSITIONS=661} [2022-12-13 02:13:41,864 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 185 predicate places. [2022-12-13 02:13:41,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:13:41,864 INFO L89 Accepts]: Start accepts. Operand has 217 places, 661 transitions, 18435 flow [2022-12-13 02:13:41,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:13:41,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:13:41,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 661 transitions, 18435 flow [2022-12-13 02:13:41,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 661 transitions, 18435 flow [2022-12-13 02:13:44,475 INFO L130 PetriNetUnfolder]: 6797/14309 cut-off events. [2022-12-13 02:13:44,475 INFO L131 PetriNetUnfolder]: For 500120/501025 co-relation queries the response was YES. [2022-12-13 02:13:44,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129879 conditions, 14309 events. 6797/14309 cut-off events. For 500120/501025 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 134633 event pairs, 328 based on Foata normal form. 275/12346 useless extension candidates. Maximal degree in co-relation 127846. Up to 4783 conditions per place. [2022-12-13 02:13:44,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 661 transitions, 18435 flow [2022-12-13 02:13:44,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 4740 [2022-12-13 02:13:44,716 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:13:44,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2853 [2022-12-13 02:13:44,717 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 661 transitions, 18435 flow [2022-12-13 02:13:44,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 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) [2022-12-13 02:13:44,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:13:44,717 INFO L214 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] [2022-12-13 02:13:44,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 02:13:44,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:13:44,922 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 02:13:44,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:13:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash 700320403, now seen corresponding path program 1 times [2022-12-13 02:13:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:13:44,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549712388] [2022-12-13 02:13:44,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:13:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:13:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:13:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:13:47,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:13:47,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549712388] [2022-12-13 02:13:47,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549712388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:13:47,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455799970] [2022-12-13 02:13:47,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:13:47,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:13:47,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:13:47,282 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) [2022-12-13 02:13:47,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 02:13:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:13:47,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-13 02:13:47,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:13:48,179 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 02:13:48,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 10 [2022-12-13 02:13:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:13:48,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:13:49,145 INFO L321 Elim1Store]: treesize reduction 30, result has 87.0 percent of original size [2022-12-13 02:13:49,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 254 [2022-12-13 02:13:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:13:49,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455799970] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:13:49,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:13:49,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-12-13 02:13:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501590965] [2022-12-13 02:13:49,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:13:49,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 02:13:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:13:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 02:13:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-12-13 02:13:49,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 02:13:49,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 661 transitions, 18435 flow. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 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) [2022-12-13 02:13:49,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:13:49,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 02:13:49,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:14:12,809 WARN L233 SmtUtils]: Spent 15.94s on a formula simplification. DAG size of input: 118 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:14:22,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:14:37,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:14:40,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:14:43,410 INFO L130 PetriNetUnfolder]: 31674/47443 cut-off events. [2022-12-13 02:14:43,411 INFO L131 PetriNetUnfolder]: For 2274921/2274921 co-relation queries the response was YES. [2022-12-13 02:14:43,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482568 conditions, 47443 events. 31674/47443 cut-off events. For 2274921/2274921 co-relation queries the response was YES. Maximal size of possible extension queue 1880. Compared 332794 event pairs, 8542 based on Foata normal form. 5/41842 useless extension candidates. Maximal degree in co-relation 470562. Up to 46242 conditions per place. [2022-12-13 02:14:44,127 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 771 selfloop transitions, 181 changer transitions 13/965 dead transitions. [2022-12-13 02:14:44,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 965 transitions, 25851 flow [2022-12-13 02:14:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 02:14:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 02:14:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 248 transitions. [2022-12-13 02:14:44,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25806451612903225 [2022-12-13 02:14:44,129 INFO L175 Difference]: Start difference. First operand has 217 places, 661 transitions, 18435 flow. Second operand 31 states and 248 transitions. [2022-12-13 02:14:44,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 965 transitions, 25851 flow [2022-12-13 02:14:53,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 965 transitions, 25353 flow, removed 215 selfloop flow, removed 4 redundant places. [2022-12-13 02:14:53,349 INFO L231 Difference]: Finished difference. Result has 262 places, 820 transitions, 23111 flow [2022-12-13 02:14:53,349 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=18025, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=23111, PETRI_PLACES=262, PETRI_TRANSITIONS=820} [2022-12-13 02:14:53,350 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 230 predicate places. [2022-12-13 02:14:53,350 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:14:53,350 INFO L89 Accepts]: Start accepts. Operand has 262 places, 820 transitions, 23111 flow [2022-12-13 02:14:53,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:14:53,358 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:14:53,359 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 820 transitions, 23111 flow [2022-12-13 02:14:53,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 820 transitions, 23111 flow [2022-12-13 02:14:54,416 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][434], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), 421#true, Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), 296#true, Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), 797#true, 409#true, Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 904#(and (<= ~n2~0 2) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0)), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:54,416 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-13 02:14:54,417 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 02:14:54,417 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,417 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,419 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][434], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 797#true, 409#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 845#true, Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 904#(and (<= ~n2~0 2) (= ~q2~0.offset 0) (= ~q2_back~0 ~q2_front~0)), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:54,419 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-13 02:14:54,419 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,419 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,419 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 02:14:54,714 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][512], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 14#thread3EXITtrue, Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), 1009#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 797#true, 409#true, Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:54,715 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,715 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,715 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:54,715 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:54,715 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][513], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), 421#true, Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 296#true, Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), 741#true, Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 797#true, 409#true, Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), 35#L94-2true, Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:54,715 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,716 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:54,716 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:54,716 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,718 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][512], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 14#thread3EXITtrue, Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), 1009#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), 797#true, 409#true, Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:54,719 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,719 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:54,719 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:54,719 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,719 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][513], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), 797#true, 409#true, Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:54,719 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 02:14:54,719 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:54,719 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:54,720 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 02:14:55,193 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][558], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 409#true, 797#true, Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,193 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,193 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,193 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,193 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,193 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][559], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 14#thread3EXITtrue, Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), 1009#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 409#true, 797#true, Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,194 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,194 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,194 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,194 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,195 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][558], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 409#true, 797#true, Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,196 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,196 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,196 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,196 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,196 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([913] L94-2-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| (select (select |v_#memory_int_In_7| v_~q2~0.base_In_1) (+ v_~q2~0.offset_In_1 (* v_~q2_front~0_In_1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_2| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~t~0_Out_6 (+ |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| v_~t~0_In_3)) (= (+ v_~C~0_In_3 v_~z~0_In_3) v_~z~0_Out_6) (= |v_thread3Thread1of1ForFork0_~k~0#1_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (+ v_~q2_front~0_In_1 1) v_~q2_front~0_Out_6) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~q2_front~0_In_1) (< v_~q2_front~0_In_1 v_~q2_back~0_In_1) (< v_~q2_front~0_In_1 v_~n2~0_In_3)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) InVars {~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, ~q2~0.offset=v_~q2~0.offset_In_1, ~q2_front~0=v_~q2_front~0_In_1, #memory_int=|v_#memory_int_In_7|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_In_3, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_In_3} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_Out_2|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~n2~0=v_~n2~0_In_3, ~C~0=v_~C~0_In_3, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~q2~0.offset=v_~q2~0.offset_In_1, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_2|, ~q2_front~0=v_~q2_front~0_Out_6, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_2|, #memory_int=|v_#memory_int_In_7|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_Out_2|, ~q2~0.base=v_~q2~0.base_In_1, ~z~0=v_~z~0_Out_6, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_Out_2|, ~q2_back~0=v_~q2_back~0_In_1, ~t~0=v_~t~0_Out_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][559], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 14#thread3EXITtrue, Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), 1009#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 409#true, 797#true, Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 355#(<= ~q2_back~0 ~q2_front~0), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,196 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,196 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,196 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,196 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,538 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][530], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 296#true, Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), 353#true, Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 797#true, 409#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,538 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-13 02:14:55,538 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,538 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,538 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 02:14:55,539 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][530], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 421#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 296#true, Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 741#true, Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), 353#true, Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 797#true, 409#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,539 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-13 02:14:55,539 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 02:14:55,540 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 02:14:55,540 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,759 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][696], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), 421#true, Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), 741#true, Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), 353#true, Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 409#true, 797#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,759 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 02:14:55,760 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,760 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 02:14:55,760 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 02:14:55,760 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][696], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 824#true, Black: 261#(<= ~q2_back~0 ~q2_front~0), 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), 421#true, Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), 296#true, Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), 741#true, Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), 353#true, Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 409#true, 797#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), 784#true, Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,761 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 02:14:55,761 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 02:14:55,761 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 02:14:55,761 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 02:14:55,862 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][689], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 421#true, Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 296#true, Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), 741#true, Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), 353#true, Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 409#true, 797#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 845#true, Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,862 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 02:14:55,862 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 02:14:55,862 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 02:14:55,862 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 02:14:55,863 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][689], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 421#true, Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 296#true, Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), 741#true, Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), 353#true, Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 409#true, 797#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), 845#true, Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), 1192#true, Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:55,863 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 02:14:55,863 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 02:14:55,863 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 02:14:55,863 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 02:14:56,265 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][714], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), 421#true, Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 296#true, Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), 741#true, Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), 353#true, Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 797#true, 409#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), 59#thread1EXITtrue, Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:56,265 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 02:14:56,265 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 02:14:56,265 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 02:14:56,265 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 02:14:56,267 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L94-2-->L94-2: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (and (< v_~q2_front~0_97 v_~n2~0_96) (<= 0 v_~q2_front~0_97) (< v_~q2_front~0_97 v_~q2_back~0_120)) 1 0)) (= (+ v_~q2_front~0_97 1) v_~q2_front~0_96) (= (+ v_~z~0_60 v_~C~0_77) v_~z~0_59) (not (= |v_thread3Thread1of1ForFork0_~k~0#1_39| 0)) (= v_~t~0_66 (+ v_~t~0_67 |v_thread3Thread1of1ForFork0_~k~0#1_39|)) (= |v_thread3Thread1of1ForFork0_~k~0#1_39| (select (select |v_#memory_int_213| v_~q2~0.base_77) (+ v_~q2~0.offset_77 (* 4 v_~q2_front~0_97)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|)) InVars {~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, ~q2~0.offset=v_~q2~0.offset_77, #memory_int=|v_#memory_int_213|, ~q2_front~0=v_~q2_front~0_97, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_60, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_67} OutVars{thread3Thread1of1ForFork0_#t~mem10#1=|v_thread3Thread1of1ForFork0_#t~mem10#1_21|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~n2~0=v_~n2~0_96, ~C~0=v_~C~0_77, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, ~q2~0.offset=v_~q2~0.offset_77, ~q2_front~0=v_~q2_front~0_96, #memory_int=|v_#memory_int_213|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_21|, ~q2~0.base=v_~q2~0.base_77, ~z~0=v_~z~0_59, thread3Thread1of1ForFork0_~k~0#1=|v_thread3Thread1of1ForFork0_~k~0#1_39|, ~q2_back~0=v_~q2_back~0_120, ~t~0=v_~t~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem10#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post11#1, ~q2_front~0, ~z~0, thread3Thread1of1ForFork0_~k~0#1, ~t~0][714], [Black: 958#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 261#(<= ~q2_back~0 ~q2_front~0), 824#true, 810#true, Black: 1030#(and (= ~q1~0.offset 0) (or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), Black: 770#true, 1347#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (= ~q2_back~0 ~q2_front~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 788#(and (or (and (< 0 ~q1_front~0) (or (and (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1)) (not (= ~q1_back~0 2))) (< 0 ~q1_back~0) (or (<= ~q1_back~0 2) (<= ~n1~0 3))) (= ~q1_back~0 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1_back~0 1))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1502#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)))) (< ~q2_back~0 0)), 421#true, Black: 1548#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~z~0) (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (= (mod ~y~0 2) 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (= (* 2 (div (- ~y~0) (- 2))) ~x~0) (<= ~N~0 1) (= ~t~0 1) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (< 0 ~N~0)), Black: 789#(and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (or (and (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (and (< 0 ~q1_front~0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_front~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 296#true, Black: 1414#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1506#(or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))), Black: 1488#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)), Black: 1544#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (< ~q2_back~0 0)) (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~y~0 (* 2 ~C~0)) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (< ~q2_back~0 0)) (<= 0 ~q2_front~0) (= ~t~0 0) (= ~x~0 (* 2 ~C~0)) (<= ~N~0 1) (= ~q2~0.offset 0) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (< ~q2_back~0 0)) (= ~z~0 0) (< 0 ~N~0) (<= ~q2_front~0 0)), Black: 1560#(and (= ~t~0 ~N~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1418#(and (<= ~n2~0 2) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< 0 ~N~0)), 1372#true, Black: 1432#(and (<= ~n2~0 2) (= ~y~0 ~C~0) (< ~q2_front~0 ~n2~0) (exists ((~q1_front~0 Int) (~q1~0.base Int)) (and (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) 1) (= (select (select |#memory_int| ~q1~0.base) (+ (- 4) (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~t~0 0) (not (< 1 ~N~0)) (= ~x~0 (* 2 ~C~0)) (= ~q2~0.offset 0) (= ~z~0 0) (< 0 ~N~0)), Black: 1467#(and (= (mod ~x~0 4294967296) (mod (+ ~z~0 ~C~0) 4294967296)) (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1532#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1498#(or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0)), Black: 1554#(and (or (and (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))))) (or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0)))), Black: 1471#(and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1481#(or (and (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 806#(and (or (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset)) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 1550#(and (or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0)) (= (mod ~x~0 4294967296) (mod (+ ~y~0 ~C~0) 4294967296))) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296))), Black: 1460#(and (= ~t~0 ~N~0) (= (mod ~x~0 4294967296) (mod ~y~0 4294967296)) (= (mod ~x~0 4294967296) (mod ~z~0 4294967296))), Black: 1538#(and (<= ~n2~0 2) (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~x~0 ~C~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~y~0 0) (or (<= ~n1~0 ~q1_back~0) (and (or (< 1 ~q1_back~0) (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 2)) (and (<= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~N~0) (<= |thread1Thread1of1ForFork1_~i~0#1| (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))))) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (= ~q2~0.offset 0) (= ~z~0 0) (= ~q2_back~0 ~q2_front~0) (< |thread1Thread1of1ForFork1_~i~0#1| (+ ~N~0 1))), Black: 1540#(and (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (or (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)))) (forall ((~q2~0.base Int)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|))))) (< ~q2_back~0 0)) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4)))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 ~C~0) 4294967296)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (< 1 ~N~0) (< ~q2_back~0 0) (and (forall ((~C~0 Int)) (= (mod (+ ~y~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (forall ((~C~0 Int)) (= (mod (+ ~z~0 (* 2 ~C~0)) 4294967296) (mod (+ ~x~0 (* 2 ~C~0)) 4294967296))) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (< 0 ~N~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (forall ((~q2~0.base Int)) (or (= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (= (mod ~x~0 4294967296) (mod (+ ~y~0 (* 2 ~C~0)) 4294967296)) (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))) (or (forall ((~q2~0.base Int)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (mod ~x~0 4294967296) (mod (+ ~z~0 (* 2 ~C~0)) 4294967296)))) (< ~q2_back~0 0))), Black: 301#(and (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 300#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0)), 741#true, Black: 816#(or (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (<= ~n1~0 3)) (not (<= 0 ~q2_back~0))), 836#true, 11#L75true, Black: 314#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 313#(<= ~q1_back~0 ~q1_front~0), Black: 829#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~q1_front~0 2) (< 0 (+ ~q1_front~0 1))), 24#L49-5true, Black: 828#(and (<= 1 ~N~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1)) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 8))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 842#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (< 1 ~q1_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2_back~0 ~q2_front~0) (<= ~n1~0 3))), Black: 568#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 561#(= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 1282#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1197#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), 353#true, Black: 1339#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 1343#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0)), Black: 1308#(or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))), Black: 336#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0)), Black: 1286#(or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), Black: 847#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (<= (+ ~q1_front~0 1) 0))), Black: 1345#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 851#(or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))), Black: 1064#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 1353#(and (or (not (<= 0 ~q2_back~0)) (forall ((v_ArrVal_2238 (Array Int Int))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2238) ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0))) (not (< ~q2_back~0 ~n2~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0))), Black: 1081#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 1196#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2~0.offset 0)), Black: 1351#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))) (or (< ~n2~0 (+ 2 ~q2_back~0)) (and (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4))) (< ~q2_back~0 0))), Black: 849#(and (or (not (= ~q1_front~0 0)) (<= ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= ~q1_front~0 1))) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (< 0 (+ ~q1_front~0 1))), Black: 1357#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n2~0 (+ 2 ~q2_back~0)) (< ~q2_back~0 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< ~n2~0 (+ 2 ~q2_back~0)) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (< ~q2_back~0 0)) (= ~q2~0.offset 0)), Black: 597#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)) (<= ~q1_front~0 1)), Black: 596#(and (or (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= ~q1_front~0 1)) (not (= ~q1_front~0 0)) (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1_front~0 1))) (< 0 (+ ~q1_front~0 1))) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~q2_back~0 ~q2_front~0)), Black: 346#(and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)), 797#true, 409#true, Black: 345#(or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= ~q2_front~0 ~q2_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0))), Black: 356#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 355#(<= ~q2_back~0 ~q2_front~0), 311#true, 859#true, Black: 618#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0))) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (or (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~q2_back~0 ~q2_front~0)) (= ~q1~0.offset 0) (= ~q2~0.offset 0) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))))), Black: 366#(and (= ~q1~0.offset 0) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~n1~0 ~q1_back~0))), 869#true, 47#L129-4true, Black: 651#(and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (and (or (<= ~q1_back~0 ~q1_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (< 4 (+ ~q1~0.offset (* ~q1_front~0 4))) (and (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= ~n1~0 3)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 4)))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1))) (= ~q2~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 845#true, Black: 402#(and (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= (+ (* ~n1~0 4) ~q1~0.offset (* ~q1_front~0 4)) (+ (* ~q1_back~0 4) 4)) (< 0 (+ ~q1_front~0 1))) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~n1~0 ~q1_back~0) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))))), Black: 664#(and (= |thread1Thread1of1ForFork1_~i~0#1| 1) (= ~q1~0.offset 0) (<= |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 ~q1_front~0)))))), Black: 414#(or (and (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), 784#true, Black: 1167#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 431#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 429#(and (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 12)) (<= ~q1_front~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 440#(or (and (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n1~0 ~q1_back~0)), Black: 444#(= |thread2Thread1of1ForFork2_~j~0#1| 1), Black: 708#(and (or (<= ~n2~0 ~q2_back~0) (and (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (not (<= 0 ~q2_back~0))) (= ~q1~0.offset 0)), Black: 715#(and (or (and (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 5 (+ (* ~q1_back~0 4) ~q1~0.offset))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (not (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 3)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 4))) (<= ~q1_back~0 1))), Black: 233#(<= ~q1_back~0 ~q1_front~0), Black: 750#(and (or (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= (+ (* ~n1~0 4) (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4)) (+ (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 16 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= ~q1_back~0 0) (= ~q1_back~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (+ ~q1_front~0 1) 0)) (= ~q1_back~0 ~q1_front~0) (or (and (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= (+ ~q1_front~0 1) 0))), Black: 752#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_back~0))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< 0 (+ ~q1_front~0 1))), Black: 238#(and (<= 0 ~N~0) (= ~x~0 0) (= ~y~0 0) (= ~z~0 0)), Black: 1011#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (<= ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 35#L94-2true, Black: 954#(not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)), Black: 1007#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 872#(and (or (<= ~n2~0 2) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (= ~q2~0.offset 0) (or (and (<= (+ ~n2~0 ~q2_front~0) (+ 2 ~q2_back~0)) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), Black: 874#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= ~q2~0.offset 0) (<= ~q2_front~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))), Black: 920#(and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n2~0 2) (< ~q2_front~0 ~n2~0) (<= 0 ~q2_front~0) (= ~q2~0.offset 0) (= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 873#(and (or (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (and (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))) (= ~q2~0.offset 0))]) [2022-12-13 02:14:56,267 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 02:14:56,267 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 02:14:56,267 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 02:14:56,267 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 02:14:56,806 INFO L130 PetriNetUnfolder]: 7155/14842 cut-off events. [2022-12-13 02:14:56,806 INFO L131 PetriNetUnfolder]: For 511090/511939 co-relation queries the response was YES. [2022-12-13 02:14:56,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137184 conditions, 14842 events. 7155/14842 cut-off events. For 511090/511939 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 139026 event pairs, 317 based on Foata normal form. 335/12877 useless extension candidates. Maximal degree in co-relation 136631. Up to 4842 conditions per place.