/usr/bin/java -Xmx16000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 03:04:34,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 03:04:34,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 03:04:34,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 03:04:34,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 03:04:34,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 03:04:34,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 03:04:34,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 03:04:34,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 03:04:34,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 03:04:34,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 03:04:34,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 03:04:34,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 03:04:34,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 03:04:34,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 03:04:34,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 03:04:34,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 03:04:34,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 03:04:34,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 03:04:34,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 03:04:34,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 03:04:34,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 03:04:34,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 03:04:34,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 03:04:34,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 03:04:34,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 03:04:34,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 03:04:34,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 03:04:34,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 03:04:34,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 03:04:34,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 03:04:34,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 03:04:34,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 03:04:34,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 03:04:34,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 03:04:34,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 03:04:34,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 03:04:34,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 03:04:34,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 03:04:34,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 03:04:34,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 03:04:34,149 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-NoLbe.epf [2022-01-19 03:04:34,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 03:04:34,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 03:04:34,172 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 03:04:34,172 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 03:04:34,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 03:04:34,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 03:04:34,172 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 03:04:34,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 03:04:34,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 03:04:34,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 03:04:34,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 03:04:34,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 03:04:34,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 03:04:34,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 03:04:34,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 03:04:34,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 03:04:34,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 03:04:34,175 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 03:04:34,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 03:04:34,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 03:04:34,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 03:04:34,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 03:04:34,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 03:04:34,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:04:34,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 03:04:34,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 03:04:34,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 03:04:34,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 03:04:34,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 03:04:34,178 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 03:04:34,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 03:04:34,178 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-01-19 03:04:34,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 03:04:34,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 03:04:34,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 03:04:34,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 03:04:34,412 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 03:04:34,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-01-19 03:04:34,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9da9f968/26a9b604c73e4732a173235146631cf3/FLAG6a70ca94e [2022-01-19 03:04:34,848 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 03:04:34,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-01-19 03:04:34,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9da9f968/26a9b604c73e4732a173235146631cf3/FLAG6a70ca94e [2022-01-19 03:04:34,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9da9f968/26a9b604c73e4732a173235146631cf3 [2022-01-19 03:04:34,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 03:04:34,873 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 03:04:34,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 03:04:34,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 03:04:34,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 03:04:34,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:04:34" (1/1) ... [2022-01-19 03:04:34,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa4d07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:34, skipping insertion in model container [2022-01-19 03:04:34,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:04:34" (1/1) ... [2022-01-19 03:04:34,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 03:04:34,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 03:04:35,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2641,2654] [2022-01-19 03:04:35,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:04:35,077 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 03:04:35,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2641,2654] [2022-01-19 03:04:35,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:04:35,109 INFO L208 MainTranslator]: Completed translation [2022-01-19 03:04:35,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35 WrapperNode [2022-01-19 03:04:35,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 03:04:35,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 03:04:35,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 03:04:35,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 03:04:35,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,152 INFO L137 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 162 [2022-01-19 03:04:35,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 03:04:35,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 03:04:35,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 03:04:35,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 03:04:35,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 03:04:35,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 03:04:35,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 03:04:35,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 03:04:35,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (1/1) ... [2022-01-19 03:04:35,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:04:35,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:04:35,204 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-01-19 03:04:35,210 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-01-19 03:04:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 03:04:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 03:04:35,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 03:04:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 03:04:35,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 03:04:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 03:04:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 03:04:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 03:04:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 03:04:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 03:04:35,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 03:04:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 03:04:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 03:04:35,239 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 03:04:35,303 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 03:04:35,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 03:04:35,518 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 03:04:35,528 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 03:04:35,528 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 03:04:35,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:04:35 BoogieIcfgContainer [2022-01-19 03:04:35,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 03:04:35,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 03:04:35,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 03:04:35,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 03:04:35,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 03:04:34" (1/3) ... [2022-01-19 03:04:35,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c18ddbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:04:35, skipping insertion in model container [2022-01-19 03:04:35,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:04:35" (2/3) ... [2022-01-19 03:04:35,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c18ddbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:04:35, skipping insertion in model container [2022-01-19 03:04:35,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:04:35" (3/3) ... [2022-01-19 03:04:35,536 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2022-01-19 03:04:35,539 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 03:04:35,539 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 03:04:35,540 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 03:04:35,606 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,606 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,606 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,607 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,616 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,616 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,632 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,632 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,632 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,632 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,634 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,634 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,634 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,634 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,635 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,635 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,636 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,636 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,636 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,637 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,637 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,637 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,637 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,640 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,640 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,640 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,640 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,640 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,640 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,641 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,641 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,641 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,641 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,641 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,642 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,642 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,642 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,642 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,642 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,642 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,643 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,643 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,643 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,643 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,643 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,643 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,644 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,644 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,644 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,644 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,644 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,645 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,645 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,645 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,645 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,645 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,646 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,646 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,646 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,646 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,646 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,647 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,647 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,647 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,647 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,647 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,648 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,649 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,650 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,651 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,652 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,652 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,652 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,653 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,653 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,653 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,653 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,653 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,653 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,654 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,654 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,654 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,654 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,654 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,654 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,655 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,655 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,657 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,658 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,658 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,658 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,658 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,658 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,658 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,661 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,661 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,661 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,661 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,661 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,661 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,661 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,662 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,662 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,662 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,662 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,662 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,662 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,663 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:04:35,667 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 03:04:35,705 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 03:04:35,711 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 03:04:35,711 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 03:04:35,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 198 places, 209 transitions, 434 flow [2022-01-19 03:04:35,795 INFO L129 PetriNetUnfolder]: 18/207 cut-off events. [2022-01-19 03:04:35,796 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:04:35,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 207 events. 18/207 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 316 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2022-01-19 03:04:35,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 209 transitions, 434 flow [2022-01-19 03:04:35,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 198 transitions, 408 flow [2022-01-19 03:04:35,857 INFO L129 PetriNetUnfolder]: 16/182 cut-off events. [2022-01-19 03:04:35,857 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:04:35,857 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:35,858 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:35,858 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash -641401192, now seen corresponding path program 1 times [2022-01-19 03:04:35,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:35,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564183526] [2022-01-19 03:04:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:35,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:36,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:36,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564183526] [2022-01-19 03:04:36,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564183526] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:36,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:36,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 03:04:36,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042928551] [2022-01-19 03:04:36,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:36,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 03:04:36,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:36,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 03:04:36,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 03:04:36,120 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 209 [2022-01-19 03:04:36,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 198 transitions, 408 flow. Second operand has 2 states, 2 states have (on average 194.0) internal successors, (388), 2 states have internal predecessors, (388), 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-01-19 03:04:36,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:36,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 209 [2022-01-19 03:04:36,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:36,196 INFO L129 PetriNetUnfolder]: 5/185 cut-off events. [2022-01-19 03:04:36,196 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 03:04:36,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 185 events. 5/185 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 284 event pairs, 0 based on Foata normal form. 16/186 useless extension candidates. Maximal degree in co-relation 104. Up to 5 conditions per place. [2022-01-19 03:04:36,204 INFO L132 encePairwiseOnDemand]: 196/209 looper letters, 4 selfloop transitions, 0 changer transitions 4/185 dead transitions. [2022-01-19 03:04:36,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 185 transitions, 390 flow [2022-01-19 03:04:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 03:04:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 03:04:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 399 transitions. [2022-01-19 03:04:36,217 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2022-01-19 03:04:36,218 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 399 transitions. [2022-01-19 03:04:36,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 399 transitions. [2022-01-19 03:04:36,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:36,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 399 transitions. [2022-01-19 03:04:36,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 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-01-19 03:04:36,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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-01-19 03:04:36,232 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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-01-19 03:04:36,233 INFO L186 Difference]: Start difference. First operand has 187 places, 198 transitions, 408 flow. Second operand 2 states and 399 transitions. [2022-01-19 03:04:36,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 185 transitions, 390 flow [2022-01-19 03:04:36,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 185 transitions, 382 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 03:04:36,240 INFO L242 Difference]: Finished difference. Result has 184 places, 181 transitions, 366 flow [2022-01-19 03:04:36,242 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=366, PETRI_PLACES=184, PETRI_TRANSITIONS=181} [2022-01-19 03:04:36,245 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, -3 predicate places. [2022-01-19 03:04:36,245 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 181 transitions, 366 flow [2022-01-19 03:04:36,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 194.0) internal successors, (388), 2 states have internal predecessors, (388), 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-01-19 03:04:36,245 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:36,245 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:36,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 03:04:36,246 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:36,247 INFO L85 PathProgramCache]: Analyzing trace with hash 317017016, now seen corresponding path program 1 times [2022-01-19 03:04:36,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:36,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804741513] [2022-01-19 03:04:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:36,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:36,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:36,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804741513] [2022-01-19 03:04:36,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804741513] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:36,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:36,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 03:04:36,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092911615] [2022-01-19 03:04:36,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:36,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 03:04:36,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:36,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 03:04:36,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 03:04:36,601 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 209 [2022-01-19 03:04:36,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 181 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-01-19 03:04:36,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:36,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 209 [2022-01-19 03:04:36,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:36,778 INFO L129 PetriNetUnfolder]: 153/760 cut-off events. [2022-01-19 03:04:36,779 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-01-19 03:04:36,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 760 events. 153/760 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3814 event pairs, 34 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 1026. Up to 164 conditions per place. [2022-01-19 03:04:36,788 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 39 selfloop transitions, 7 changer transitions 0/202 dead transitions. [2022-01-19 03:04:36,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 202 transitions, 502 flow [2022-01-19 03:04:36,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 03:04:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 03:04:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 727 transitions. [2022-01-19 03:04:36,794 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8696172248803827 [2022-01-19 03:04:36,794 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 727 transitions. [2022-01-19 03:04:36,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 727 transitions. [2022-01-19 03:04:36,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:36,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 727 transitions. [2022-01-19 03:04:36,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 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-01-19 03:04:36,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-01-19 03:04:36,802 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-01-19 03:04:36,802 INFO L186 Difference]: Start difference. First operand has 184 places, 181 transitions, 366 flow. Second operand 4 states and 727 transitions. [2022-01-19 03:04:36,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 202 transitions, 502 flow [2022-01-19 03:04:36,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 202 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 03:04:36,811 INFO L242 Difference]: Finished difference. Result has 185 places, 187 transitions, 413 flow [2022-01-19 03:04:36,812 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=413, PETRI_PLACES=185, PETRI_TRANSITIONS=187} [2022-01-19 03:04:36,813 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, -2 predicate places. [2022-01-19 03:04:36,813 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 187 transitions, 413 flow [2022-01-19 03:04:36,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-01-19 03:04:36,814 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:36,814 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:36,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 03:04:36,815 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash -299465594, now seen corresponding path program 1 times [2022-01-19 03:04:36,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:36,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994849355] [2022-01-19 03:04:36,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:36,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:37,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:37,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994849355] [2022-01-19 03:04:37,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994849355] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:37,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:37,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 03:04:37,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991426764] [2022-01-19 03:04:37,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:37,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 03:04:37,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:37,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 03:04:37,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 03:04:37,025 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 03:04:37,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 187 transitions, 413 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-01-19 03:04:37,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:37,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 03:04:37,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:37,366 INFO L129 PetriNetUnfolder]: 355/1781 cut-off events. [2022-01-19 03:04:37,367 INFO L130 PetriNetUnfolder]: For 193/195 co-relation queries the response was YES. [2022-01-19 03:04:37,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1781 events. 355/1781 cut-off events. For 193/195 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12993 event pairs, 127 based on Foata normal form. 8/1643 useless extension candidates. Maximal degree in co-relation 2704. Up to 366 conditions per place. [2022-01-19 03:04:37,380 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 82 selfloop transitions, 7 changer transitions 0/242 dead transitions. [2022-01-19 03:04:37,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 242 transitions, 770 flow [2022-01-19 03:04:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 03:04:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 03:04:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions. [2022-01-19 03:04:37,384 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8588516746411483 [2022-01-19 03:04:37,384 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions. [2022-01-19 03:04:37,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions. [2022-01-19 03:04:37,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:37,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions. [2022-01-19 03:04:37,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 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-01-19 03:04:37,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-19 03:04:37,390 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-19 03:04:37,390 INFO L186 Difference]: Start difference. First operand has 185 places, 187 transitions, 413 flow. Second operand 6 states and 1077 transitions. [2022-01-19 03:04:37,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 242 transitions, 770 flow [2022-01-19 03:04:37,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 242 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 03:04:37,399 INFO L242 Difference]: Finished difference. Result has 193 places, 191 transitions, 461 flow [2022-01-19 03:04:37,400 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=461, PETRI_PLACES=193, PETRI_TRANSITIONS=191} [2022-01-19 03:04:37,402 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 6 predicate places. [2022-01-19 03:04:37,402 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 191 transitions, 461 flow [2022-01-19 03:04:37,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-01-19 03:04:37,403 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:37,403 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:37,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 03:04:37,403 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:37,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:37,405 INFO L85 PathProgramCache]: Analyzing trace with hash 781561804, now seen corresponding path program 2 times [2022-01-19 03:04:37,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:37,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38371940] [2022-01-19 03:04:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:37,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:37,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:37,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38371940] [2022-01-19 03:04:37,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38371940] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:37,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:37,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 03:04:37,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203024232] [2022-01-19 03:04:37,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:37,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 03:04:37,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:37,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 03:04:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-19 03:04:37,704 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 209 [2022-01-19 03:04:37,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 191 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 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-01-19 03:04:37,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:37,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 209 [2022-01-19 03:04:37,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:37,939 INFO L129 PetriNetUnfolder]: 183/1122 cut-off events. [2022-01-19 03:04:37,940 INFO L130 PetriNetUnfolder]: For 329/381 co-relation queries the response was YES. [2022-01-19 03:04:37,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 1122 events. 183/1122 cut-off events. For 329/381 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7694 event pairs, 101 based on Foata normal form. 49/1081 useless extension candidates. Maximal degree in co-relation 1768. Up to 243 conditions per place. [2022-01-19 03:04:37,947 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 37 selfloop transitions, 11 changer transitions 3/208 dead transitions. [2022-01-19 03:04:37,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 208 transitions, 623 flow [2022-01-19 03:04:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 03:04:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 03:04:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 893 transitions. [2022-01-19 03:04:37,949 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8545454545454545 [2022-01-19 03:04:37,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 893 transitions. [2022-01-19 03:04:37,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 893 transitions. [2022-01-19 03:04:37,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:37,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 893 transitions. [2022-01-19 03:04:37,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.6) internal successors, (893), 5 states have internal predecessors, (893), 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-01-19 03:04:37,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-01-19 03:04:37,955 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-01-19 03:04:37,955 INFO L186 Difference]: Start difference. First operand has 193 places, 191 transitions, 461 flow. Second operand 5 states and 893 transitions. [2022-01-19 03:04:37,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 208 transitions, 623 flow [2022-01-19 03:04:37,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 208 transitions, 615 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 03:04:37,960 INFO L242 Difference]: Finished difference. Result has 198 places, 192 transitions, 496 flow [2022-01-19 03:04:37,960 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=496, PETRI_PLACES=198, PETRI_TRANSITIONS=192} [2022-01-19 03:04:37,961 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 11 predicate places. [2022-01-19 03:04:37,961 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 192 transitions, 496 flow [2022-01-19 03:04:37,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 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-01-19 03:04:37,962 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:37,962 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:37,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 03:04:37,962 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:37,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash -119616610, now seen corresponding path program 1 times [2022-01-19 03:04:37,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:37,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65688499] [2022-01-19 03:04:37,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:37,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:38,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:38,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65688499] [2022-01-19 03:04:38,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65688499] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:38,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:38,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 03:04:38,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670473800] [2022-01-19 03:04:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:38,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 03:04:38,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 03:04:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 03:04:38,136 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 03:04:38,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 192 transitions, 496 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-01-19 03:04:38,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:38,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 03:04:38,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:38,458 INFO L129 PetriNetUnfolder]: 373/1941 cut-off events. [2022-01-19 03:04:38,459 INFO L130 PetriNetUnfolder]: For 807/819 co-relation queries the response was YES. [2022-01-19 03:04:38,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 1941 events. 373/1941 cut-off events. For 807/819 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 14729 event pairs, 168 based on Foata normal form. 14/1822 useless extension candidates. Maximal degree in co-relation 3327. Up to 352 conditions per place. [2022-01-19 03:04:38,471 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 80 selfloop transitions, 13 changer transitions 2/248 dead transitions. [2022-01-19 03:04:38,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 248 transitions, 935 flow [2022-01-19 03:04:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 03:04:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 03:04:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1082 transitions. [2022-01-19 03:04:38,474 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8628389154704944 [2022-01-19 03:04:38,474 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1082 transitions. [2022-01-19 03:04:38,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1082 transitions. [2022-01-19 03:04:38,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:38,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1082 transitions. [2022-01-19 03:04:38,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 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-01-19 03:04:38,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-19 03:04:38,480 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-19 03:04:38,481 INFO L186 Difference]: Start difference. First operand has 198 places, 192 transitions, 496 flow. Second operand 6 states and 1082 transitions. [2022-01-19 03:04:38,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 248 transitions, 935 flow [2022-01-19 03:04:38,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 248 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:04:38,490 INFO L242 Difference]: Finished difference. Result has 206 places, 200 transitions, 609 flow [2022-01-19 03:04:38,491 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=609, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2022-01-19 03:04:38,491 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 19 predicate places. [2022-01-19 03:04:38,491 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 609 flow [2022-01-19 03:04:38,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-01-19 03:04:38,492 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:38,492 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:38,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 03:04:38,492 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:38,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:38,493 INFO L85 PathProgramCache]: Analyzing trace with hash 527597564, now seen corresponding path program 2 times [2022-01-19 03:04:38,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:38,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922711105] [2022-01-19 03:04:38,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:38,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:38,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:38,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922711105] [2022-01-19 03:04:38,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922711105] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:38,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:38,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 03:04:38,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445480983] [2022-01-19 03:04:38,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:38,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 03:04:38,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:38,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 03:04:38,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 03:04:38,638 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 03:04:38,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 609 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-01-19 03:04:38,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:38,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 03:04:38,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:38,986 INFO L129 PetriNetUnfolder]: 394/2019 cut-off events. [2022-01-19 03:04:38,986 INFO L130 PetriNetUnfolder]: For 1472/1474 co-relation queries the response was YES. [2022-01-19 03:04:38,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 2019 events. 394/2019 cut-off events. For 1472/1474 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 15554 event pairs, 195 based on Foata normal form. 10/1894 useless extension candidates. Maximal degree in co-relation 3691. Up to 465 conditions per place. [2022-01-19 03:04:39,001 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 62 selfloop transitions, 18 changer transitions 0/233 dead transitions. [2022-01-19 03:04:39,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 233 transitions, 912 flow [2022-01-19 03:04:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 03:04:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 03:04:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2022-01-19 03:04:39,004 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2022-01-19 03:04:39,004 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1064 transitions. [2022-01-19 03:04:39,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1064 transitions. [2022-01-19 03:04:39,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:39,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1064 transitions. [2022-01-19 03:04:39,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 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-01-19 03:04:39,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-19 03:04:39,010 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-19 03:04:39,010 INFO L186 Difference]: Start difference. First operand has 206 places, 200 transitions, 609 flow. Second operand 6 states and 1064 transitions. [2022-01-19 03:04:39,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 233 transitions, 912 flow [2022-01-19 03:04:39,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 233 transitions, 889 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-19 03:04:39,020 INFO L242 Difference]: Finished difference. Result has 211 places, 204 transitions, 682 flow [2022-01-19 03:04:39,021 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=682, PETRI_PLACES=211, PETRI_TRANSITIONS=204} [2022-01-19 03:04:39,023 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 24 predicate places. [2022-01-19 03:04:39,023 INFO L470 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 682 flow [2022-01-19 03:04:39,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-01-19 03:04:39,024 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:39,024 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:39,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 03:04:39,024 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1665551690, now seen corresponding path program 3 times [2022-01-19 03:04:39,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:39,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352728693] [2022-01-19 03:04:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:39,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:39,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:39,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352728693] [2022-01-19 03:04:39,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352728693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:39,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:39,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 03:04:39,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965665864] [2022-01-19 03:04:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:39,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 03:04:39,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 03:04:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 03:04:39,198 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 03:04:39,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 204 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-01-19 03:04:39,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:39,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 03:04:39,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:39,621 INFO L129 PetriNetUnfolder]: 465/2340 cut-off events. [2022-01-19 03:04:39,621 INFO L130 PetriNetUnfolder]: For 2549/2551 co-relation queries the response was YES. [2022-01-19 03:04:39,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4415 conditions, 2340 events. 465/2340 cut-off events. For 2549/2551 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 18640 event pairs, 201 based on Foata normal form. 7/2198 useless extension candidates. Maximal degree in co-relation 4396. Up to 410 conditions per place. [2022-01-19 03:04:39,640 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 74 selfloop transitions, 20 changer transitions 0/247 dead transitions. [2022-01-19 03:04:39,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 247 transitions, 1066 flow [2022-01-19 03:04:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 03:04:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 03:04:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1241 transitions. [2022-01-19 03:04:39,644 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.848257006151743 [2022-01-19 03:04:39,644 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1241 transitions. [2022-01-19 03:04:39,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1241 transitions. [2022-01-19 03:04:39,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:39,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1241 transitions. [2022-01-19 03:04:39,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 177.28571428571428) internal successors, (1241), 7 states have internal predecessors, (1241), 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-01-19 03:04:39,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-01-19 03:04:39,652 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-01-19 03:04:39,652 INFO L186 Difference]: Start difference. First operand has 211 places, 204 transitions, 682 flow. Second operand 7 states and 1241 transitions. [2022-01-19 03:04:39,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 247 transitions, 1066 flow [2022-01-19 03:04:39,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 247 transitions, 1032 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-01-19 03:04:39,666 INFO L242 Difference]: Finished difference. Result has 216 places, 206 transitions, 721 flow [2022-01-19 03:04:39,667 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=721, PETRI_PLACES=216, PETRI_TRANSITIONS=206} [2022-01-19 03:04:39,668 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 29 predicate places. [2022-01-19 03:04:39,668 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 206 transitions, 721 flow [2022-01-19 03:04:39,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-01-19 03:04:39,669 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:39,669 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:39,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 03:04:39,669 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:39,670 INFO L85 PathProgramCache]: Analyzing trace with hash 21117964, now seen corresponding path program 4 times [2022-01-19 03:04:39,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:39,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702737720] [2022-01-19 03:04:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:39,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:39,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:39,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702737720] [2022-01-19 03:04:39,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702737720] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:39,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:39,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 03:04:39,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766908356] [2022-01-19 03:04:39,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:39,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 03:04:39,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:39,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 03:04:39,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 03:04:39,756 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 03:04:39,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 206 transitions, 721 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-01-19 03:04:39,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:39,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 03:04:39,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:40,132 INFO L129 PetriNetUnfolder]: 447/2285 cut-off events. [2022-01-19 03:04:40,132 INFO L130 PetriNetUnfolder]: For 2796/2798 co-relation queries the response was YES. [2022-01-19 03:04:40,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4428 conditions, 2285 events. 447/2285 cut-off events. For 2796/2798 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 18098 event pairs, 190 based on Foata normal form. 2/2130 useless extension candidates. Maximal degree in co-relation 4407. Up to 414 conditions per place. [2022-01-19 03:04:40,147 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 75 selfloop transitions, 18 changer transitions 0/246 dead transitions. [2022-01-19 03:04:40,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 246 transitions, 1096 flow [2022-01-19 03:04:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 03:04:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 03:04:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 904 transitions. [2022-01-19 03:04:40,149 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8650717703349282 [2022-01-19 03:04:40,149 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 904 transitions. [2022-01-19 03:04:40,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 904 transitions. [2022-01-19 03:04:40,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:40,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 904 transitions. [2022-01-19 03:04:40,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 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-01-19 03:04:40,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-01-19 03:04:40,154 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-01-19 03:04:40,154 INFO L186 Difference]: Start difference. First operand has 216 places, 206 transitions, 721 flow. Second operand 5 states and 904 transitions. [2022-01-19 03:04:40,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 246 transitions, 1096 flow [2022-01-19 03:04:40,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 246 transitions, 1044 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-01-19 03:04:40,166 INFO L242 Difference]: Finished difference. Result has 218 places, 208 transitions, 760 flow [2022-01-19 03:04:40,166 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=760, PETRI_PLACES=218, PETRI_TRANSITIONS=208} [2022-01-19 03:04:40,168 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 31 predicate places. [2022-01-19 03:04:40,168 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 208 transitions, 760 flow [2022-01-19 03:04:40,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-01-19 03:04:40,169 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:40,169 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:40,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 03:04:40,169 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1070521520, now seen corresponding path program 5 times [2022-01-19 03:04:40,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:40,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765675514] [2022-01-19 03:04:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:40,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:40,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:40,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765675514] [2022-01-19 03:04:40,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765675514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:40,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:40,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 03:04:40,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660381657] [2022-01-19 03:04:40,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:40,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 03:04:40,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:40,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 03:04:40,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 03:04:40,258 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 03:04:40,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 208 transitions, 760 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-01-19 03:04:40,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:40,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 03:04:40,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:40,552 INFO L129 PetriNetUnfolder]: 458/2294 cut-off events. [2022-01-19 03:04:40,552 INFO L130 PetriNetUnfolder]: For 2983/2986 co-relation queries the response was YES. [2022-01-19 03:04:40,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 2294 events. 458/2294 cut-off events. For 2983/2986 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 18005 event pairs, 236 based on Foata normal form. 4/2140 useless extension candidates. Maximal degree in co-relation 4431. Up to 607 conditions per place. [2022-01-19 03:04:40,574 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 64 selfloop transitions, 22 changer transitions 0/239 dead transitions. [2022-01-19 03:04:40,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 239 transitions, 1103 flow [2022-01-19 03:04:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 03:04:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 03:04:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 895 transitions. [2022-01-19 03:04:40,576 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8564593301435407 [2022-01-19 03:04:40,576 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 895 transitions. [2022-01-19 03:04:40,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 895 transitions. [2022-01-19 03:04:40,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:40,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 895 transitions. [2022-01-19 03:04:40,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 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-01-19 03:04:40,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-01-19 03:04:40,582 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-01-19 03:04:40,582 INFO L186 Difference]: Start difference. First operand has 218 places, 208 transitions, 760 flow. Second operand 5 states and 895 transitions. [2022-01-19 03:04:40,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 239 transitions, 1103 flow [2022-01-19 03:04:40,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 239 transitions, 1066 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-01-19 03:04:40,594 INFO L242 Difference]: Finished difference. Result has 223 places, 216 transitions, 893 flow [2022-01-19 03:04:40,594 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=893, PETRI_PLACES=223, PETRI_TRANSITIONS=216} [2022-01-19 03:04:40,595 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 36 predicate places. [2022-01-19 03:04:40,595 INFO L470 AbstractCegarLoop]: Abstraction has has 223 places, 216 transitions, 893 flow [2022-01-19 03:04:40,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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-01-19 03:04:40,596 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:40,596 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:40,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 03:04:40,596 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:40,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:40,597 INFO L85 PathProgramCache]: Analyzing trace with hash 486915966, now seen corresponding path program 6 times [2022-01-19 03:04:40,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:40,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135151802] [2022-01-19 03:04:40,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:40,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:40,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:40,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135151802] [2022-01-19 03:04:40,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135151802] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:40,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:04:40,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 03:04:40,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328466124] [2022-01-19 03:04:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:40,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 03:04:40,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 03:04:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 03:04:40,765 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 03:04:40,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 216 transitions, 893 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-01-19 03:04:40,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:40,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 03:04:40,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:41,110 INFO L129 PetriNetUnfolder]: 444/2213 cut-off events. [2022-01-19 03:04:41,110 INFO L130 PetriNetUnfolder]: For 3403/3405 co-relation queries the response was YES. [2022-01-19 03:04:41,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4364 conditions, 2213 events. 444/2213 cut-off events. For 3403/3405 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 17196 event pairs, 221 based on Foata normal form. 10/2076 useless extension candidates. Maximal degree in co-relation 4338. Up to 563 conditions per place. [2022-01-19 03:04:41,126 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 69 selfloop transitions, 24 changer transitions 0/246 dead transitions. [2022-01-19 03:04:41,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 246 transitions, 1190 flow [2022-01-19 03:04:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 03:04:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 03:04:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2022-01-19 03:04:41,129 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8532695374800638 [2022-01-19 03:04:41,129 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1070 transitions. [2022-01-19 03:04:41,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1070 transitions. [2022-01-19 03:04:41,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:41,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1070 transitions. [2022-01-19 03:04:41,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 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-01-19 03:04:41,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-19 03:04:41,135 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-01-19 03:04:41,135 INFO L186 Difference]: Start difference. First operand has 223 places, 216 transitions, 893 flow. Second operand 6 states and 1070 transitions. [2022-01-19 03:04:41,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 246 transitions, 1190 flow [2022-01-19 03:04:41,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 246 transitions, 1150 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-01-19 03:04:41,150 INFO L242 Difference]: Finished difference. Result has 230 places, 219 transitions, 964 flow [2022-01-19 03:04:41,151 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=964, PETRI_PLACES=230, PETRI_TRANSITIONS=219} [2022-01-19 03:04:41,151 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 43 predicate places. [2022-01-19 03:04:41,151 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 219 transitions, 964 flow [2022-01-19 03:04:41,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-01-19 03:04:41,152 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:41,152 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:41,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 03:04:41,152 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:41,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:41,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1410643597, now seen corresponding path program 1 times [2022-01-19 03:04:41,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:41,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228236865] [2022-01-19 03:04:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:41,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:41,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228236865] [2022-01-19 03:04:41,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228236865] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:04:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029773989] [2022-01-19 03:04:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:41,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:04:41,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:04:41,351 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-01-19 03:04:41,380 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-01-19 03:04:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:41,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-19 03:04:41,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:04:42,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-01-19 03:04:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:42,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:04:42,336 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 03:04:42,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2022-01-19 03:04:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:42,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029773989] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:04:42,485 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:04:42,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 9] total 23 [2022-01-19 03:04:42,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653237894] [2022-01-19 03:04:42,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:04:42,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 03:04:42,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:42,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 03:04:42,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-01-19 03:04:42,490 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 209 [2022-01-19 03:04:42,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 219 transitions, 964 flow. Second operand has 23 states, 23 states have (on average 113.17391304347827) internal successors, (2603), 23 states have internal predecessors, (2603), 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-01-19 03:04:42,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:42,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 209 [2022-01-19 03:04:42,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:46,764 INFO L129 PetriNetUnfolder]: 7342/17187 cut-off events. [2022-01-19 03:04:46,764 INFO L130 PetriNetUnfolder]: For 20602/20602 co-relation queries the response was YES. [2022-01-19 03:04:46,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37360 conditions, 17187 events. 7342/17187 cut-off events. For 20602/20602 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 161010 event pairs, 392 based on Foata normal form. 33/16538 useless extension candidates. Maximal degree in co-relation 37331. Up to 3162 conditions per place. [2022-01-19 03:04:46,899 INFO L132 encePairwiseOnDemand]: 177/209 looper letters, 666 selfloop transitions, 140 changer transitions 8/910 dead transitions. [2022-01-19 03:04:46,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 910 transitions, 5589 flow [2022-01-19 03:04:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-19 03:04:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-01-19 03:04:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 6228 transitions. [2022-01-19 03:04:46,914 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5730585204269415 [2022-01-19 03:04:46,915 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 6228 transitions. [2022-01-19 03:04:46,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 6228 transitions. [2022-01-19 03:04:46,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:46,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 6228 transitions. [2022-01-19 03:04:46,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 119.76923076923077) internal successors, (6228), 52 states have internal predecessors, (6228), 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-01-19 03:04:46,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 209.0) internal successors, (11077), 53 states have internal predecessors, (11077), 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-01-19 03:04:46,962 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 209.0) internal successors, (11077), 53 states have internal predecessors, (11077), 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-01-19 03:04:46,962 INFO L186 Difference]: Start difference. First operand has 230 places, 219 transitions, 964 flow. Second operand 52 states and 6228 transitions. [2022-01-19 03:04:46,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 910 transitions, 5589 flow [2022-01-19 03:04:47,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 910 transitions, 5398 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-01-19 03:04:47,045 INFO L242 Difference]: Finished difference. Result has 310 places, 362 transitions, 2066 flow [2022-01-19 03:04:47,045 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=2066, PETRI_PLACES=310, PETRI_TRANSITIONS=362} [2022-01-19 03:04:47,046 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 123 predicate places. [2022-01-19 03:04:47,046 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 362 transitions, 2066 flow [2022-01-19 03:04:47,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 113.17391304347827) internal successors, (2603), 23 states have internal predecessors, (2603), 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-01-19 03:04:47,047 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:47,047 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:47,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 03:04:47,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 03:04:47,263 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1359667531, now seen corresponding path program 2 times [2022-01-19 03:04:47,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:47,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624979668] [2022-01-19 03:04:47,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:47,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:47,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:47,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624979668] [2022-01-19 03:04:47,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624979668] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:04:47,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475561135] [2022-01-19 03:04:47,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 03:04:47,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:04:47,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:04:47,488 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-01-19 03:04:47,516 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-01-19 03:04:47,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 03:04:47,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:04:47,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 03:04:47,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:04:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:04:48,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:04:48,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475561135] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:48,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 03:04:48,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2022-01-19 03:04:48,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839224537] [2022-01-19 03:04:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:48,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 03:04:48,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:48,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 03:04:48,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-19 03:04:48,049 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 209 [2022-01-19 03:04:48,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 362 transitions, 2066 flow. Second operand has 9 states, 9 states have (on average 140.66666666666666) internal successors, (1266), 9 states have internal predecessors, (1266), 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-01-19 03:04:48,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:48,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 209 [2022-01-19 03:04:48,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:49,075 INFO L129 PetriNetUnfolder]: 1112/5337 cut-off events. [2022-01-19 03:04:49,075 INFO L130 PetriNetUnfolder]: For 9151/9242 co-relation queries the response was YES. [2022-01-19 03:04:49,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12509 conditions, 5337 events. 1112/5337 cut-off events. For 9151/9242 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 53502 event pairs, 257 based on Foata normal form. 14/4996 useless extension candidates. Maximal degree in co-relation 12449. Up to 1393 conditions per place. [2022-01-19 03:04:49,117 INFO L132 encePairwiseOnDemand]: 188/209 looper letters, 94 selfloop transitions, 54 changer transitions 19/413 dead transitions. [2022-01-19 03:04:49,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 413 transitions, 2546 flow [2022-01-19 03:04:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 03:04:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 03:04:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1756 transitions. [2022-01-19 03:04:49,122 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7001594896331739 [2022-01-19 03:04:49,122 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1756 transitions. [2022-01-19 03:04:49,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1756 transitions. [2022-01-19 03:04:49,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:49,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1756 transitions. [2022-01-19 03:04:49,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 146.33333333333334) internal successors, (1756), 12 states have internal predecessors, (1756), 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-01-19 03:04:49,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 209.0) internal successors, (2717), 13 states have internal predecessors, (2717), 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-01-19 03:04:49,132 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 209.0) internal successors, (2717), 13 states have internal predecessors, (2717), 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-01-19 03:04:49,132 INFO L186 Difference]: Start difference. First operand has 310 places, 362 transitions, 2066 flow. Second operand 12 states and 1756 transitions. [2022-01-19 03:04:49,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 413 transitions, 2546 flow [2022-01-19 03:04:49,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 413 transitions, 2456 flow, removed 19 selfloop flow, removed 10 redundant places. [2022-01-19 03:04:49,192 INFO L242 Difference]: Finished difference. Result has 314 places, 377 transitions, 2225 flow [2022-01-19 03:04:49,192 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1976, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2225, PETRI_PLACES=314, PETRI_TRANSITIONS=377} [2022-01-19 03:04:49,193 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 127 predicate places. [2022-01-19 03:04:49,193 INFO L470 AbstractCegarLoop]: Abstraction has has 314 places, 377 transitions, 2225 flow [2022-01-19 03:04:49,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 140.66666666666666) internal successors, (1266), 9 states have internal predecessors, (1266), 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-01-19 03:04:49,194 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:49,194 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:49,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 03:04:49,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 03:04:49,415 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2032396257, now seen corresponding path program 1 times [2022-01-19 03:04:49,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:49,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118374751] [2022-01-19 03:04:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:49,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:04:49,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:49,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118374751] [2022-01-19 03:04:49,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118374751] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:04:49,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676349642] [2022-01-19 03:04:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:49,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:04:49,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:04:49,656 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-01-19 03:04:49,679 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-01-19 03:04:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:49,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-19 03:04:49,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:04:50,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-01-19 03:04:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:04:50,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:04:50,523 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 03:04:50,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2022-01-19 03:04:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:04:50,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676349642] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:04:50,686 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:04:50,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 9] total 22 [2022-01-19 03:04:50,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405749783] [2022-01-19 03:04:50,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:04:50,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 03:04:50,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:50,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 03:04:50,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-01-19 03:04:50,692 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 209 [2022-01-19 03:04:50,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 377 transitions, 2225 flow. Second operand has 22 states, 22 states have (on average 113.27272727272727) internal successors, (2492), 22 states have internal predecessors, (2492), 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-01-19 03:04:50,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:50,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 209 [2022-01-19 03:04:50,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:55,049 INFO L129 PetriNetUnfolder]: 8548/19653 cut-off events. [2022-01-19 03:04:55,050 INFO L130 PetriNetUnfolder]: For 52327/52421 co-relation queries the response was YES. [2022-01-19 03:04:55,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58485 conditions, 19653 events. 8548/19653 cut-off events. For 52327/52421 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 185765 event pairs, 2091 based on Foata normal form. 71/19376 useless extension candidates. Maximal degree in co-relation 58422. Up to 7621 conditions per place. [2022-01-19 03:04:55,225 INFO L132 encePairwiseOnDemand]: 178/209 looper letters, 588 selfloop transitions, 208 changer transitions 4/899 dead transitions. [2022-01-19 03:04:55,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 899 transitions, 7137 flow [2022-01-19 03:04:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-19 03:04:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-01-19 03:04:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 7007 transitions. [2022-01-19 03:04:55,237 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5496117342536669 [2022-01-19 03:04:55,237 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 7007 transitions. [2022-01-19 03:04:55,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 7007 transitions. [2022-01-19 03:04:55,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:55,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 7007 transitions. [2022-01-19 03:04:55,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 114.8688524590164) internal successors, (7007), 61 states have internal predecessors, (7007), 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-01-19 03:04:55,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 209.0) internal successors, (12958), 62 states have internal predecessors, (12958), 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-01-19 03:04:55,272 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 209.0) internal successors, (12958), 62 states have internal predecessors, (12958), 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-01-19 03:04:55,272 INFO L186 Difference]: Start difference. First operand has 314 places, 377 transitions, 2225 flow. Second operand 61 states and 7007 transitions. [2022-01-19 03:04:55,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 899 transitions, 7137 flow [2022-01-19 03:04:55,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 899 transitions, 7075 flow, removed 27 selfloop flow, removed 6 redundant places. [2022-01-19 03:04:55,590 INFO L242 Difference]: Finished difference. Result has 396 places, 539 transitions, 4662 flow [2022-01-19 03:04:55,591 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=4662, PETRI_PLACES=396, PETRI_TRANSITIONS=539} [2022-01-19 03:04:55,592 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 209 predicate places. [2022-01-19 03:04:55,592 INFO L470 AbstractCegarLoop]: Abstraction has has 396 places, 539 transitions, 4662 flow [2022-01-19 03:04:55,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 113.27272727272727) internal successors, (2492), 22 states have internal predecessors, (2492), 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-01-19 03:04:55,593 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:55,593 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:55,616 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-01-19 03:04:55,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:04:55,812 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash -575446859, now seen corresponding path program 2 times [2022-01-19 03:04:55,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909034956] [2022-01-19 03:04:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:55,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:04:56,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:56,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909034956] [2022-01-19 03:04:56,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909034956] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:04:56,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383673999] [2022-01-19 03:04:56,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 03:04:56,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:04:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:04:56,020 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-01-19 03:04:56,047 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-01-19 03:04:56,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 03:04:56,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:04:56,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 03:04:56,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:04:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 03:04:56,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:04:56,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383673999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:04:56,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 03:04:56,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-01-19 03:04:56,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706037599] [2022-01-19 03:04:56,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:04:56,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 03:04:56,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:04:56,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 03:04:56,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-19 03:04:56,626 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 209 [2022-01-19 03:04:56,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 539 transitions, 4662 flow. Second operand has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 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-01-19 03:04:56,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:04:56,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 209 [2022-01-19 03:04:56,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:04:57,491 INFO L129 PetriNetUnfolder]: 937/4709 cut-off events. [2022-01-19 03:04:57,492 INFO L130 PetriNetUnfolder]: For 19373/19544 co-relation queries the response was YES. [2022-01-19 03:04:57,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14334 conditions, 4709 events. 937/4709 cut-off events. For 19373/19544 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 44506 event pairs, 181 based on Foata normal form. 110/4662 useless extension candidates. Maximal degree in co-relation 14242. Up to 605 conditions per place. [2022-01-19 03:04:57,557 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 81 selfloop transitions, 48 changer transitions 0/581 dead transitions. [2022-01-19 03:04:57,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 581 transitions, 5202 flow [2022-01-19 03:04:57,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 03:04:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 03:04:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1236 transitions. [2022-01-19 03:04:57,559 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8448393711551606 [2022-01-19 03:04:57,559 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1236 transitions. [2022-01-19 03:04:57,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1236 transitions. [2022-01-19 03:04:57,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:04:57,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1236 transitions. [2022-01-19 03:04:57,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 176.57142857142858) internal successors, (1236), 7 states have internal predecessors, (1236), 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-01-19 03:04:57,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-01-19 03:04:57,563 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-01-19 03:04:57,563 INFO L186 Difference]: Start difference. First operand has 396 places, 539 transitions, 4662 flow. Second operand 7 states and 1236 transitions. [2022-01-19 03:04:57,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 581 transitions, 5202 flow [2022-01-19 03:04:57,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 581 transitions, 4702 flow, removed 243 selfloop flow, removed 9 redundant places. [2022-01-19 03:04:57,843 INFO L242 Difference]: Finished difference. Result has 394 places, 542 transitions, 4302 flow [2022-01-19 03:04:57,844 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=4162, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4302, PETRI_PLACES=394, PETRI_TRANSITIONS=542} [2022-01-19 03:04:57,844 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 207 predicate places. [2022-01-19 03:04:57,844 INFO L470 AbstractCegarLoop]: Abstraction has has 394 places, 542 transitions, 4302 flow [2022-01-19 03:04:57,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 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-01-19 03:04:57,844 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:04:57,845 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:04:57,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 03:04:58,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:04:58,049 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:04:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:04:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1266164479, now seen corresponding path program 1 times [2022-01-19 03:04:58,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:04:58,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725538218] [2022-01-19 03:04:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:58,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:04:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:04:58,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:04:58,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725538218] [2022-01-19 03:04:58,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725538218] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:04:58,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212684747] [2022-01-19 03:04:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:04:58,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:04:58,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:04:58,291 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-01-19 03:04:58,293 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-01-19 03:04:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:04:58,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 03:04:58,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:04:59,622 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 03:04:59,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20 [2022-01-19 03:04:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:04:59,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:05:00,154 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:05:00,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-01-19 03:05:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:05:01,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212684747] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:05:01,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:05:01,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 47 [2022-01-19 03:05:01,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083021995] [2022-01-19 03:05:01,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:05:01,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 03:05:01,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:05:01,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 03:05:01,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1958, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 03:05:01,256 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 209 [2022-01-19 03:05:01,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 542 transitions, 4302 flow. Second operand has 47 states, 47 states have (on average 85.76595744680851) internal successors, (4031), 47 states have internal predecessors, (4031), 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-01-19 03:05:01,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:05:01,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 209 [2022-01-19 03:05:01,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:05:18,388 INFO L129 PetriNetUnfolder]: 17676/37846 cut-off events. [2022-01-19 03:05:18,388 INFO L130 PetriNetUnfolder]: For 163093/163397 co-relation queries the response was YES. [2022-01-19 03:05:18,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127641 conditions, 37846 events. 17676/37846 cut-off events. For 163093/163397 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 386617 event pairs, 2606 based on Foata normal form. 119/37322 useless extension candidates. Maximal degree in co-relation 127547. Up to 13620 conditions per place. [2022-01-19 03:05:19,073 INFO L132 encePairwiseOnDemand]: 144/209 looper letters, 1131 selfloop transitions, 541 changer transitions 306/2110 dead transitions. [2022-01-19 03:05:19,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 2110 transitions, 17936 flow [2022-01-19 03:05:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-01-19 03:05:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2022-01-19 03:05:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 13768 transitions. [2022-01-19 03:05:19,091 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43339209267187107 [2022-01-19 03:05:19,091 INFO L72 ComplementDD]: Start complementDD. Operand 152 states and 13768 transitions. [2022-01-19 03:05:19,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 13768 transitions. [2022-01-19 03:05:19,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:05:19,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 152 states and 13768 transitions. [2022-01-19 03:05:19,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 153 states, 152 states have (on average 90.57894736842105) internal successors, (13768), 152 states have internal predecessors, (13768), 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-01-19 03:05:19,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 153 states, 153 states have (on average 209.0) internal successors, (31977), 153 states have internal predecessors, (31977), 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-01-19 03:05:19,160 INFO L81 ComplementDD]: Finished complementDD. Result has 153 states, 153 states have (on average 209.0) internal successors, (31977), 153 states have internal predecessors, (31977), 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-01-19 03:05:19,160 INFO L186 Difference]: Start difference. First operand has 394 places, 542 transitions, 4302 flow. Second operand 152 states and 13768 transitions. [2022-01-19 03:05:19,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 2110 transitions, 17936 flow [2022-01-19 03:05:20,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 2110 transitions, 17739 flow, removed 51 selfloop flow, removed 2 redundant places. [2022-01-19 03:05:20,417 INFO L242 Difference]: Finished difference. Result has 635 places, 961 transitions, 9462 flow [2022-01-19 03:05:20,418 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=4253, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=152, PETRI_FLOW=9462, PETRI_PLACES=635, PETRI_TRANSITIONS=961} [2022-01-19 03:05:20,418 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 448 predicate places. [2022-01-19 03:05:20,418 INFO L470 AbstractCegarLoop]: Abstraction has has 635 places, 961 transitions, 9462 flow [2022-01-19 03:05:20,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 85.76595744680851) internal successors, (4031), 47 states have internal predecessors, (4031), 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-01-19 03:05:20,419 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:05:20,419 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:05:20,435 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-01-19 03:05:20,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 03:05:20,620 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:05:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:05:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash -443919373, now seen corresponding path program 2 times [2022-01-19 03:05:20,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:05:20,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364533864] [2022-01-19 03:05:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:05:20,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:05:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:05:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:05:20,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:05:20,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364533864] [2022-01-19 03:05:20,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364533864] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:05:20,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275039962] [2022-01-19 03:05:20,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 03:05:20,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:05:20,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:05:20,807 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-01-19 03:05:20,808 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-01-19 03:05:20,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 03:05:20,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:05:20,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-19 03:05:20,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:05:21,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 03:05:21,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 03:05:21,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 03:05:22,384 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 03:05:22,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20 [2022-01-19 03:05:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:05:22,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:05:56,160 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:05:56,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 78 [2022-01-19 03:05:56,169 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:05:56,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 488 treesize of output 444 [2022-01-19 03:05:56,184 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:05:56,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 496 treesize of output 378 [2022-01-19 03:05:56,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:05:56,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 352 treesize of output 306 [2022-01-19 03:06:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:06:04,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275039962] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:06:04,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:06:04,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30, 27] total 61 [2022-01-19 03:06:04,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086213631] [2022-01-19 03:06:04,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:06:04,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-19 03:06:04,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:06:04,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-19 03:06:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3201, Unknown=113, NotChecked=0, Total=3660 [2022-01-19 03:06:04,626 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 209 [2022-01-19 03:06:04,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 961 transitions, 9462 flow. Second operand has 61 states, 61 states have (on average 71.21311475409836) internal successors, (4344), 61 states have internal predecessors, (4344), 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-01-19 03:06:04,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:06:04,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 209 [2022-01-19 03:06:04,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:06:27,878 INFO L129 PetriNetUnfolder]: 19477/42396 cut-off events. [2022-01-19 03:06:27,878 INFO L130 PetriNetUnfolder]: For 1482183/1482581 co-relation queries the response was YES. [2022-01-19 03:06:29,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320280 conditions, 42396 events. 19477/42396 cut-off events. For 1482183/1482581 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 446841 event pairs, 3379 based on Foata normal form. 128/41828 useless extension candidates. Maximal degree in co-relation 320094. Up to 15506 conditions per place. [2022-01-19 03:06:29,248 INFO L132 encePairwiseOnDemand]: 135/209 looper letters, 1347 selfloop transitions, 692 changer transitions 84/2245 dead transitions. [2022-01-19 03:06:29,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 2245 transitions, 31603 flow [2022-01-19 03:06:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-01-19 03:06:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2022-01-19 03:06:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 10101 transitions. [2022-01-19 03:06:29,260 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.36613745106568074 [2022-01-19 03:06:29,260 INFO L72 ComplementDD]: Start complementDD. Operand 132 states and 10101 transitions. [2022-01-19 03:06:29,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 10101 transitions. [2022-01-19 03:06:29,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:06:29,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 132 states and 10101 transitions. [2022-01-19 03:06:29,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 133 states, 132 states have (on average 76.52272727272727) internal successors, (10101), 132 states have internal predecessors, (10101), 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-01-19 03:06:29,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 133 states, 133 states have (on average 209.0) internal successors, (27797), 133 states have internal predecessors, (27797), 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-01-19 03:06:29,300 INFO L81 ComplementDD]: Finished complementDD. Result has 133 states, 133 states have (on average 209.0) internal successors, (27797), 133 states have internal predecessors, (27797), 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-01-19 03:06:29,301 INFO L186 Difference]: Start difference. First operand has 635 places, 961 transitions, 9462 flow. Second operand 132 states and 10101 transitions. [2022-01-19 03:06:29,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 2245 transitions, 31603 flow [2022-01-19 03:06:34,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 2245 transitions, 30576 flow, removed 468 selfloop flow, removed 12 redundant places. [2022-01-19 03:06:34,972 INFO L242 Difference]: Finished difference. Result has 792 places, 1303 transitions, 15748 flow [2022-01-19 03:06:34,972 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=8913, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=132, PETRI_FLOW=15748, PETRI_PLACES=792, PETRI_TRANSITIONS=1303} [2022-01-19 03:06:34,973 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 605 predicate places. [2022-01-19 03:06:34,973 INFO L470 AbstractCegarLoop]: Abstraction has has 792 places, 1303 transitions, 15748 flow [2022-01-19 03:06:34,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 71.21311475409836) internal successors, (4344), 61 states have internal predecessors, (4344), 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-01-19 03:06:34,974 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:06:34,974 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:06:34,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 03:06:35,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-19 03:06:35,178 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:06:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:06:35,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1960467287, now seen corresponding path program 1 times [2022-01-19 03:06:35,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:06:35,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204105417] [2022-01-19 03:06:35,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:06:35,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:06:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:06:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:06:35,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:06:35,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204105417] [2022-01-19 03:06:35,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204105417] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:06:35,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073685355] [2022-01-19 03:06:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:06:35,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:06:35,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:06:35,364 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-01-19 03:06:35,365 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-01-19 03:06:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:06:35,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 03:06:35,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:06:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:06:35,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:06:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:06:36,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073685355] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:06:36,120 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:06:36,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2022-01-19 03:06:36,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654645155] [2022-01-19 03:06:36,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:06:36,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 03:06:36,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:06:36,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 03:06:36,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-01-19 03:06:36,123 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2022-01-19 03:06:36,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 1303 transitions, 15748 flow. Second operand has 19 states, 19 states have (on average 167.47368421052633) internal successors, (3182), 19 states have internal predecessors, (3182), 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-01-19 03:06:36,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:06:36,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2022-01-19 03:06:36,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:06:47,494 INFO L129 PetriNetUnfolder]: 6033/25718 cut-off events. [2022-01-19 03:06:47,495 INFO L130 PetriNetUnfolder]: For 1024327/1040762 co-relation queries the response was YES. [2022-01-19 03:06:48,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172868 conditions, 25718 events. 6033/25718 cut-off events. For 1024327/1040762 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 330169 event pairs, 1433 based on Foata normal form. 305/24767 useless extension candidates. Maximal degree in co-relation 172616. Up to 3960 conditions per place. [2022-01-19 03:06:48,449 INFO L132 encePairwiseOnDemand]: 187/209 looper letters, 340 selfloop transitions, 477 changer transitions 10/1708 dead transitions. [2022-01-19 03:06:48,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 812 places, 1708 transitions, 23273 flow [2022-01-19 03:06:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 03:06:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 03:06:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5176 transitions. [2022-01-19 03:06:48,455 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.825518341307815 [2022-01-19 03:06:48,455 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5176 transitions. [2022-01-19 03:06:48,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5176 transitions. [2022-01-19 03:06:48,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:06:48,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5176 transitions. [2022-01-19 03:06:48,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 172.53333333333333) internal successors, (5176), 30 states have internal predecessors, (5176), 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-01-19 03:06:48,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 209.0) internal successors, (6479), 31 states have internal predecessors, (6479), 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-01-19 03:06:48,465 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 209.0) internal successors, (6479), 31 states have internal predecessors, (6479), 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-01-19 03:06:48,465 INFO L186 Difference]: Start difference. First operand has 792 places, 1303 transitions, 15748 flow. Second operand 30 states and 5176 transitions. [2022-01-19 03:06:48,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 812 places, 1708 transitions, 23273 flow [2022-01-19 03:06:53,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 781 places, 1708 transitions, 21214 flow, removed 939 selfloop flow, removed 31 redundant places. [2022-01-19 03:06:54,011 INFO L242 Difference]: Finished difference. Result has 795 places, 1524 transitions, 19061 flow [2022-01-19 03:06:54,012 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=14177, PETRI_DIFFERENCE_MINUEND_PLACES=752, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=19061, PETRI_PLACES=795, PETRI_TRANSITIONS=1524} [2022-01-19 03:06:54,013 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 608 predicate places. [2022-01-19 03:06:54,013 INFO L470 AbstractCegarLoop]: Abstraction has has 795 places, 1524 transitions, 19061 flow [2022-01-19 03:06:54,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 167.47368421052633) internal successors, (3182), 19 states have internal predecessors, (3182), 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-01-19 03:06:54,013 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:06:54,014 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:06:54,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 03:06:54,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:06:54,227 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:06:54,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:06:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash 337846925, now seen corresponding path program 3 times [2022-01-19 03:06:54,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:06:54,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173939245] [2022-01-19 03:06:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:06:54,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:06:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:06:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:06:54,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:06:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173939245] [2022-01-19 03:06:54,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173939245] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:06:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232862316] [2022-01-19 03:06:54,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 03:06:54,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:06:54,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:06:54,444 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:06:54,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 03:06:54,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 03:06:54,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:06:54,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-19 03:06:54,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:06:55,599 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 03:06:55,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 13 [2022-01-19 03:06:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:06:55,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:06:56,326 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:06:56,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 26 [2022-01-19 03:06:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:06:57,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232862316] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:06:57,644 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:06:57,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 22] total 46 [2022-01-19 03:06:57,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092222813] [2022-01-19 03:06:57,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:06:57,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 03:06:57,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:06:57,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 03:06:57,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1901, Unknown=0, NotChecked=0, Total=2070 [2022-01-19 03:06:57,648 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 209 [2022-01-19 03:06:57,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 1524 transitions, 19061 flow. Second operand has 46 states, 46 states have (on average 85.8695652173913) internal successors, (3950), 46 states have internal predecessors, (3950), 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-01-19 03:06:57,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:06:57,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 209 [2022-01-19 03:06:57,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:07:56,083 INFO L129 PetriNetUnfolder]: 35420/82717 cut-off events. [2022-01-19 03:07:56,083 INFO L130 PetriNetUnfolder]: For 5859006/5859689 co-relation queries the response was YES. [2022-01-19 03:08:01,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 806246 conditions, 82717 events. 35420/82717 cut-off events. For 5859006/5859689 co-relation queries the response was YES. Maximal size of possible extension queue 2230. Compared 1011979 event pairs, 7015 based on Foata normal form. 315/81550 useless extension candidates. Maximal degree in co-relation 805989. Up to 23528 conditions per place. [2022-01-19 03:08:02,071 INFO L132 encePairwiseOnDemand]: 147/209 looper letters, 2000 selfloop transitions, 1321 changer transitions 154/3627 dead transitions. [2022-01-19 03:08:02,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 3627 transitions, 60088 flow [2022-01-19 03:08:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-01-19 03:08:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2022-01-19 03:08:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 14556 transitions. [2022-01-19 03:08:02,088 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4246703232582565 [2022-01-19 03:08:02,088 INFO L72 ComplementDD]: Start complementDD. Operand 164 states and 14556 transitions. [2022-01-19 03:08:02,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 14556 transitions. [2022-01-19 03:08:02,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:08:02,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 164 states and 14556 transitions. [2022-01-19 03:08:02,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 165 states, 164 states have (on average 88.7560975609756) internal successors, (14556), 164 states have internal predecessors, (14556), 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-01-19 03:08:02,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 165 states, 165 states have (on average 209.0) internal successors, (34485), 165 states have internal predecessors, (34485), 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-01-19 03:08:02,145 INFO L81 ComplementDD]: Finished complementDD. Result has 165 states, 165 states have (on average 209.0) internal successors, (34485), 165 states have internal predecessors, (34485), 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-01-19 03:08:02,145 INFO L186 Difference]: Start difference. First operand has 795 places, 1524 transitions, 19061 flow. Second operand 164 states and 14556 transitions. [2022-01-19 03:08:02,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 3627 transitions, 60088 flow [2022-01-19 03:08:33,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 3627 transitions, 58622 flow, removed 592 selfloop flow, removed 8 redundant places. [2022-01-19 03:08:33,218 INFO L242 Difference]: Finished difference. Result has 1031 places, 2312 transitions, 33729 flow [2022-01-19 03:08:33,219 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=18349, PETRI_DIFFERENCE_MINUEND_PLACES=787, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=628, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=164, PETRI_FLOW=33729, PETRI_PLACES=1031, PETRI_TRANSITIONS=2312} [2022-01-19 03:08:33,220 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 844 predicate places. [2022-01-19 03:08:33,220 INFO L470 AbstractCegarLoop]: Abstraction has has 1031 places, 2312 transitions, 33729 flow [2022-01-19 03:08:33,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 85.8695652173913) internal successors, (3950), 46 states have internal predecessors, (3950), 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-01-19 03:08:33,221 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:08:33,221 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:08:33,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 03:08:33,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-19 03:08:33,421 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:08:33,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:08:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2141440705, now seen corresponding path program 2 times [2022-01-19 03:08:33,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:08:33,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742251297] [2022-01-19 03:08:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:08:33,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:08:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:08:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:08:33,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:08:33,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742251297] [2022-01-19 03:08:33,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742251297] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:08:33,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997603609] [2022-01-19 03:08:33,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 03:08:33,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:08:33,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:08:33,664 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:08:33,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 03:08:33,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 03:08:33,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:08:33,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 03:08:33,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:08:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:08:34,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:08:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:08:34,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997603609] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:08:34,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:08:34,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-01-19 03:08:34,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640780036] [2022-01-19 03:08:34,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:08:34,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 03:08:34,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:08:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 03:08:34,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-01-19 03:08:34,406 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2022-01-19 03:08:34,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 2312 transitions, 33729 flow. Second operand has 18 states, 18 states have (on average 167.55555555555554) internal successors, (3016), 18 states have internal predecessors, (3016), 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-01-19 03:08:34,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:08:34,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2022-01-19 03:08:34,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:08:58,107 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([507] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0][1500], [4040#true, 79#L95-1true, Black: 5606#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|))), Black: 6164#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (not (< (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6156#(and (not (< 1 (mod ~n~0 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|))), 1529#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 6146#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 6148#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (< (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6154#(and (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 6130#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (< (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (mod ~n~0 4294967296))) (not (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod ~n~0 4294967296))) (not (< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6158#(and (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296))) 4294967296)) (not (< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6136#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296))), Black: 5298#true, Black: 5823#(<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296))) 4294967296)), Black: 5787#(not (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod ~n~0 4294967296))), 2805#true, Black: 1099#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1083#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 1105#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1057#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0)), Black: 1035#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1107#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0)), Black: 1067#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1037#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= ~f~0.offset 0)), 235#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1093#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1097#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1091#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 1045#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1041#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1050#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 5190#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 1103#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 5074#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 1026#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5164#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 1069#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ 4294967295 ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 4042#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1039#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 5091#(and (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1)), Black: 1109#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0)), Black: 5161#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 5079#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 1061#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 1053#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0)), Black: 1085#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 4050#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0))), Black: 1028#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5167#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 5185#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 1071#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ 4294967295 ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1089#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 1087#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 5101#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1101#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1095#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 5158#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 725#(= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0), Black: 4945#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5096#(and (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 5106#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 4)))) (<= ~size~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))))), Black: 5118#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 4)))) (<= ~size~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))))), Black: 5108#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (or (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5192#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 5155#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 5141#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), 201#true, Black: 5116#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4081#(= ~x1~0 0), Black: 5143#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 4941#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4546#(= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0), Black: 4048#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 4426#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 4046#(and (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 4502#(= ~x2~0 ~x1~0), Black: 5207#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0)), Black: 5126#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_27 Int)) (and (< v_~x2~0_27 1) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5147#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 5171#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 4416#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_27 Int)) (and (< v_~x2~0_27 1) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4285#(and (= ~x1~0 0) (<= ~size~0 1)), Black: 5205#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0)), Black: 4386#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1)), Black: 5149#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 4)))) (<= ~size~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))))), Black: 5045#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4412#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5152#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 5182#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 5177#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x2~0 ~x1~0)), Black: 4430#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), 204#true, Black: 5124#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4542#(= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|), Black: 5175#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 5201#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0)), Black: 5099#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 5120#(and (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 4405#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (or (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5071#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 4947#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5088#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 5012#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5021#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 5068#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 5129#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 5132#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_27 Int)) (and (< v_~x2~0_27 1) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4943#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5084#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1)), Black: 5081#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 5122#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), 299#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 207#(and (<= (+ 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1|)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 206#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 219#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (* (div ~n~0 4294967296) 4294967296))), Black: 217#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (* (- 1) ~n~0) (* (div ~n~0 4294967296) 4294967296)) 4294967296))), Black: 227#(and (or (not (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))) (<= (+ 4294967294 ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))) (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)))), Black: 226#(or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 236#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 238#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 2760#(and (= |thread2Thread1of1ForFork1_~i~1#1| 1) (not (< 0 (mod (+ 4294967294 ~n~0) 4294967296)))), Black: 2656#(and (not (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2800#(and (= |thread2Thread1of1ForFork1_#t~post10#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 1) (not (< (mod |thread2Thread1of1ForFork1_#t~post10#1| 4294967296) (mod (+ 4294967294 ~n~0) 4294967296)))), Black: 248#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 247#(and (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (div (+ 4294967294 ~n~0) 4294967296)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 249#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 259#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 258#(<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))), Black: 278#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 281#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 277#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 289#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 291#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 290#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7257#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), 5300#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 7155#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 7412#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7415#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 7265#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7300#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7408#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7379#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7237#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7095#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7061#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 7424#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|)), Black: 7244#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7091#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7308#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7359#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7298#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 7291#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7371#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7059#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 6196#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0))), Black: 7349#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x1~0 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7462#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7132#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 7441#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (= ~x2~0 ~x1~0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7363#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7070#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 6553#(and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x1~0 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7233#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 7422#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7401#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2356#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7417#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 2324#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~f~0.offset 0)), Black: 7317#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7128#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7426#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= ~x2~0 ~x1~0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 2306#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7157#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 1533#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7255#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 2378#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7240#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2344#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7288#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 7338#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2299#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7280#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7355#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 7458#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2332#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7148#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 1531#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7374#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 2366#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7304#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2297#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7055#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 2352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7368#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7097#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0)), Black: 2326#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~f~0.offset 0)), Black: 2374#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7123#(and (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 6227#(= ~x1~0 0), Black: 1868#(= ~x2~0 ~x1~0), Black: 2376#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7100#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2372#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7126#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2318#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7275#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2358#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 6639#(= ~x2~0 ~x1~0), Black: 1825#(= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|), Black: 7336#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x1~0 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7366#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2380#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 2362#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7322#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2816#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 2342#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3708#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3794#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2360#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7464#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2346#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7302#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 3889#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (or (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< v_~x2~0_22 1)))))), Black: 7228#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2295#(and (= ~x1~0 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3922#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7449#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0)), Black: 3695#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3717#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (<= ~size~0 (+ ~x1~0 1))), Black: 7282#(and (= ~x1~0 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7431#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3159#(and (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1) (< v_~x2~0_22 1)) (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 6690#(or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3878#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1) (< v_~x2~0_22 1)) (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 7446#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x2~0 ~x1~0)), Black: 2808#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 3667#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6194#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 7220#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 7272#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7205#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 3704#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3880#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1) (< v_~x2~0_22 1)) (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 7433#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= ~x2~0 ~x1~0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7242#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3887#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (or (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< v_~x2~0_22 1)))))), Black: 3851#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (or (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 7438#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), 127#L64-2true, Black: 3910#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 7083#(and (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 6557#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3177#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 3845#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 7313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7460#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3693#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3901#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 7340#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 7285#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 3746#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3916#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3754#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), 8384#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (mod ~n~0 4294967296))), Black: 3327#(or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)), Black: 3780#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3818#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3689#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (<= ~size~0 (+ ~x1~0 1))), Black: 3673#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3715#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3181#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), 152#L51-2true, Black: 3681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3829#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (or (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 3899#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 2812#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= |thread2Thread1of1ForFork1_#t~post6#1| 1) (or (and (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), 6188#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 3891#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (< v_~x2~0_22 1)))), Black: 3907#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3119#(and (= ~x1~0 0) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 2814#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3838#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3706#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 2809#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 3895#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (< v_~x2~0_22 1))) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3729#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3166#(and (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (or (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< v_~x2~0_22 1)))))), Black: 3912#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3918#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3808#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3669#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3762#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (or (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 3700#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), 1146#true, Black: 3857#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3840#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3810#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3802#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3861#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= |thread2Thread1of1ForFork1_#t~post6#1| 1) (<= ~size~0 1) (or (and (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3800#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3170#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (< v_~x2~0_22 1)))), Black: 3768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3697#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3816#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (and (or (<= ~x1~0 0) (<= ~size~0 0)) (or (<= ~size~0 (+ ~x2~0 1)) (<= ~size~0 0)) (or (<= ~x2~0 0) (<= ~size~0 0)) (or (<= ~size~0 0) (<= ~size~0 (+ ~x1~0 1)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3748#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3932#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3770#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3903#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3905#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 3691#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3926#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3914#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 3820#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3792#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3871#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))))) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3687#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3865#(and (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))))) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 2811#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1)), Black: 3804#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3831#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3855#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3782#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3677#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3750#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3788#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3702#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (<= ~size~0 (+ ~x1~0 1))), Black: 3712#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3675#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 213#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1509#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 ~x2~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1511#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 ~x2~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0))]) [2022-01-19 03:08:58,110 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-01-19 03:08:58,111 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 03:08:58,111 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-01-19 03:08:58,111 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 03:09:03,379 INFO L129 PetriNetUnfolder]: 10118/46247 cut-off events. [2022-01-19 03:09:03,379 INFO L130 PetriNetUnfolder]: For 2162749/2185545 co-relation queries the response was YES. [2022-01-19 03:09:07,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 340708 conditions, 46247 events. 10118/46247 cut-off events. For 2162749/2185545 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 667983 event pairs, 2147 based on Foata normal form. 946/45202 useless extension candidates. Maximal degree in co-relation 340373. Up to 7042 conditions per place. [2022-01-19 03:09:07,271 INFO L132 encePairwiseOnDemand]: 192/209 looper letters, 684 selfloop transitions, 657 changer transitions 0/2827 dead transitions. [2022-01-19 03:09:07,272 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1063 places, 2827 transitions, 45204 flow [2022-01-19 03:09:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 03:09:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 03:09:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 7521 transitions. [2022-01-19 03:09:07,277 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8178555893866899 [2022-01-19 03:09:07,277 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 7521 transitions. [2022-01-19 03:09:07,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 7521 transitions. [2022-01-19 03:09:07,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:09:07,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 7521 transitions. [2022-01-19 03:09:07,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 170.9318181818182) internal successors, (7521), 44 states have internal predecessors, (7521), 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-01-19 03:09:07,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 209.0) internal successors, (9405), 45 states have internal predecessors, (9405), 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-01-19 03:09:07,293 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 209.0) internal successors, (9405), 45 states have internal predecessors, (9405), 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-01-19 03:09:07,293 INFO L186 Difference]: Start difference. First operand has 1031 places, 2312 transitions, 33729 flow. Second operand 44 states and 7521 transitions. [2022-01-19 03:09:07,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1063 places, 2827 transitions, 45204 flow [2022-01-19 03:09:29,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 2827 transitions, 43338 flow, removed 870 selfloop flow, removed 32 redundant places. [2022-01-19 03:09:29,445 INFO L242 Difference]: Finished difference. Result has 1052 places, 2623 transitions, 39767 flow [2022-01-19 03:09:29,447 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=31887, PETRI_DIFFERENCE_MINUEND_PLACES=988, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=39767, PETRI_PLACES=1052, PETRI_TRANSITIONS=2623} [2022-01-19 03:09:29,447 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 865 predicate places. [2022-01-19 03:09:29,447 INFO L470 AbstractCegarLoop]: Abstraction has has 1052 places, 2623 transitions, 39767 flow [2022-01-19 03:09:29,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 167.55555555555554) internal successors, (3016), 18 states have internal predecessors, (3016), 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-01-19 03:09:29,448 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:09:29,448 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:09:29,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 03:09:29,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:09:29,662 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:09:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:09:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1222766085, now seen corresponding path program 3 times [2022-01-19 03:09:29,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:09:29,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045013656] [2022-01-19 03:09:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:09:29,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:09:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:09:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:09:29,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:09:29,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045013656] [2022-01-19 03:09:29,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045013656] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:09:29,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303980412] [2022-01-19 03:09:29,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 03:09:29,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:09:29,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:09:29,795 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:09:29,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 03:09:29,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 03:09:29,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:09:29,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 03:09:29,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:09:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:09:30,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:09:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:09:30,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303980412] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:09:30,463 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:09:30,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 03:09:30,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070807544] [2022-01-19 03:09:30,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:09:30,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 03:09:30,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:09:30,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 03:09:30,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-01-19 03:09:30,466 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2022-01-19 03:09:30,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1052 places, 2623 transitions, 39767 flow. Second operand has 19 states, 19 states have (on average 167.42105263157896) internal successors, (3181), 19 states have internal predecessors, (3181), 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-01-19 03:09:30,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:09:30,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2022-01-19 03:09:30,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:09:56,548 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([507] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0][1604], [4040#true, 79#L95-1true, Black: 5606#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|))), Black: 6164#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (not (< (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6156#(and (not (< 1 (mod ~n~0 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|))), 1529#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 6146#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 6148#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (< (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6154#(and (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 6130#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (< (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (mod ~n~0 4294967296))) (not (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod ~n~0 4294967296))) (not (< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6158#(and (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296))) 4294967296)) (not (< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6136#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296))), Black: 5298#true, Black: 5823#(<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296))) 4294967296)), Black: 5787#(not (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod ~n~0 4294967296))), 2805#true, Black: 1099#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1083#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 1105#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1057#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0)), Black: 1035#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1107#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0)), Black: 1067#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1037#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= ~f~0.offset 0)), 235#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1093#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1097#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1091#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 1045#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1041#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1050#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 5190#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 1103#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 5074#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 1026#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5164#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 1069#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ 4294967295 ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 4042#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1039#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 5091#(and (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1)), Black: 1109#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0)), Black: 5161#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 5079#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 1061#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 1053#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0)), Black: 1085#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 4050#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0))), Black: 1028#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5167#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 1071#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ 4294967295 ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 5185#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 1089#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 1087#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 5101#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1101#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1095#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 5158#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 725#(= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0), Black: 4945#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5096#(and (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 5106#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 4)))) (<= ~size~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))))), Black: 5118#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 4)))) (<= ~size~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))))), Black: 5108#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (or (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5192#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 5155#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), 201#true, Black: 5141#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 5116#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4081#(= ~x1~0 0), Black: 5143#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 4941#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4546#(= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0), Black: 4048#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 4426#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 4046#(and (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 4502#(= ~x2~0 ~x1~0), Black: 5207#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0)), Black: 5126#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_27 Int)) (and (< v_~x2~0_27 1) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5147#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 5171#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 4416#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_27 Int)) (and (< v_~x2~0_27 1) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4285#(and (= ~x1~0 0) (<= ~size~0 1)), Black: 5205#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0)), Black: 4386#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1)), Black: 5149#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 4)))) (<= ~size~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))))), Black: 5045#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4412#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5152#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 5182#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 5177#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x2~0 ~x1~0)), Black: 4430#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), 204#true, Black: 5124#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4542#(= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|), Black: 5175#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 5201#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0)), Black: 5099#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 5120#(and (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 4405#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (or (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5071#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 4947#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5088#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 5012#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5021#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 5068#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 5129#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 5132#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_27 Int)) (and (< v_~x2~0_27 1) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4943#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5084#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1)), Black: 5081#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 5122#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), 299#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 207#(and (<= (+ 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1|)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 206#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 219#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (* (div ~n~0 4294967296) 4294967296))), Black: 217#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (* (- 1) ~n~0) (* (div ~n~0 4294967296) 4294967296)) 4294967296))), Black: 227#(and (or (not (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))) (<= (+ 4294967294 ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))) (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)))), Black: 226#(or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 236#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 238#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 2760#(and (= |thread2Thread1of1ForFork1_~i~1#1| 1) (not (< 0 (mod (+ 4294967294 ~n~0) 4294967296)))), Black: 2656#(and (not (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2800#(and (= |thread2Thread1of1ForFork1_#t~post10#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 1) (not (< (mod |thread2Thread1of1ForFork1_#t~post10#1| 4294967296) (mod (+ 4294967294 ~n~0) 4294967296)))), Black: 248#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 247#(and (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (div (+ 4294967294 ~n~0) 4294967296)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 249#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 259#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 8431#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_#t~post10#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 258#(<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7555#true, Black: 8439#(and (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 8405#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_#t~post10#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= (+ 4294967296 (* (div ~n~0 4294967296) 4294967296)) (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 7559#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 8399#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 8451#(and (<= 0 (div (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|))), Black: 8389#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296))), Black: 8415#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= (+ 4294967296 (* (div ~n~0 4294967296) 4294967296)) (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296))), Black: 8403#(and (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 8421#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= (+ 4294967296 (* (div ~n~0 4294967296) 4294967296)) (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 8443#(and (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|))), Black: 8433#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 7916#(and (<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|))), Black: 8395#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 8025#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (mod ~n~0 4294967296)), Black: 8417#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (mod ~n~0 4294967296))), Black: 8393#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= (+ 4294967296 (* (div ~n~0 4294967296) 4294967296)) (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 8391#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (mod ~n~0 4294967296))), Black: 278#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 8411#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296))), Black: 281#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 277#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 289#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 291#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 290#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 5300#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 7257#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7155#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 7412#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7415#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 7265#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7300#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7408#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7379#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7237#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7095#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7061#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 7424#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|)), Black: 7244#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7091#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7308#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7359#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7298#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 7291#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7371#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7059#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 6196#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0))), Black: 7349#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x1~0 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7132#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 7441#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (= ~x2~0 ~x1~0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7363#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7070#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 6553#(and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x1~0 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7233#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 7422#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7401#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2356#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7417#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7317#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2324#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~f~0.offset 0)), Black: 7128#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7426#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= ~x2~0 ~x1~0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 2306#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7157#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 1533#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7255#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 7240#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2344#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7338#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2299#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7280#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7355#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 2310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7148#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2332#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 1531#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7374#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 2366#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7304#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2297#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7055#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 2352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7368#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7097#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0)), Black: 2326#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~f~0.offset 0)), Black: 2374#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7123#(and (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 1868#(= ~x2~0 ~x1~0), Black: 6227#(= ~x1~0 0), Black: 2376#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7100#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7126#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2372#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 2318#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7275#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2358#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 6639#(= ~x2~0 ~x1~0), Black: 1825#(= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|), Black: 7336#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x1~0 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7366#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2362#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7322#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2816#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 2342#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 3708#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 7352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2360#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 3794#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7302#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 2346#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 3889#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (or (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< v_~x2~0_22 1)))))), Black: 2295#(and (= ~x1~0 0) (= ~x2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7228#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3922#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7449#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0)), Black: 3695#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3717#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (<= ~size~0 (+ ~x1~0 1))), Black: 7282#(and (= ~x1~0 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3159#(and (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1) (< v_~x2~0_22 1)) (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 7431#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 6690#(or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3878#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1) (< v_~x2~0_22 1)) (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 7446#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x2~0 ~x1~0)), Black: 2808#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 6194#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3667#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7220#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 7272#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7205#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 3704#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 7433#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= ~x2~0 ~x1~0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 3880#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1) (< v_~x2~0_22 1)) (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3887#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (or (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< v_~x2~0_22 1)))))), Black: 7242#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), 127#L64-2true, Black: 7438#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3851#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (or (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 3910#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 7083#(and (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3177#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 6557#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3845#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 3693#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 7340#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 3901#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 7285#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 3746#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3916#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3754#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), 8384#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (mod ~n~0 4294967296))), Black: 3327#(or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)), Black: 3780#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3818#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3689#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (<= ~size~0 (+ ~x1~0 1))), Black: 3673#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3715#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), 152#L51-2true, Black: 3181#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 3681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3829#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (or (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 3899#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 2812#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= |thread2Thread1of1ForFork1_#t~post6#1| 1) (or (and (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 3891#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (< v_~x2~0_22 1)))), 6188#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 3907#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3119#(and (= ~x1~0 0) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 2814#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3838#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3706#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 2809#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 3895#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (< v_~x2~0_22 1))) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3729#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3166#(and (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (or (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< v_~x2~0_22 1)))))), Black: 3912#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3918#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3808#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3669#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3762#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (or (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 3700#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), 1146#true, Black: 3857#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3840#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3810#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3802#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3861#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= |thread2Thread1of1ForFork1_#t~post6#1| 1) (<= ~size~0 1) (or (and (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3800#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3170#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (< v_~x2~0_22 1)))), Black: 3768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3697#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3816#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (and (or (<= ~x1~0 0) (<= ~size~0 0)) (or (<= ~size~0 (+ ~x2~0 1)) (<= ~size~0 0)) (or (<= ~x2~0 0) (<= ~size~0 0)) (or (<= ~size~0 0) (<= ~size~0 (+ ~x1~0 1)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3748#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3932#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3770#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3903#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3905#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 3691#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3926#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3914#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 3820#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3792#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3871#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))))) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3687#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3865#(and (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))))) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 2811#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1)), Black: 3804#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3831#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3855#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3782#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3677#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3750#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3788#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3702#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (<= ~size~0 (+ ~x1~0 1))), Black: 3712#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3675#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 213#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1509#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 ~x2~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1511#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 ~x2~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 8478#(= |thread1Thread1of1ForFork0_~i~0#1| 0)]) [2022-01-19 03:09:56,549 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-01-19 03:09:56,549 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-01-19 03:09:56,549 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 03:09:56,549 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 03:10:01,976 INFO L129 PetriNetUnfolder]: 10491/47513 cut-off events. [2022-01-19 03:10:01,976 INFO L130 PetriNetUnfolder]: For 2259809/2285162 co-relation queries the response was YES. [2022-01-19 03:10:05,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 358048 conditions, 47513 events. 10491/47513 cut-off events. For 2259809/2285162 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 688926 event pairs, 2175 based on Foata normal form. 721/46134 useless extension candidates. Maximal degree in co-relation 357699. Up to 7022 conditions per place. [2022-01-19 03:10:06,112 INFO L132 encePairwiseOnDemand]: 188/209 looper letters, 675 selfloop transitions, 847 changer transitions 14/3021 dead transitions. [2022-01-19 03:10:06,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1082 places, 3021 transitions, 48817 flow [2022-01-19 03:10:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 03:10:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 03:10:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5386 transitions. [2022-01-19 03:10:06,115 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.831301126717086 [2022-01-19 03:10:06,115 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5386 transitions. [2022-01-19 03:10:06,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5386 transitions. [2022-01-19 03:10:06,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:06,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5386 transitions. [2022-01-19 03:10:06,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 173.74193548387098) internal successors, (5386), 31 states have internal predecessors, (5386), 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-01-19 03:10:06,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 209.0) internal successors, (6688), 32 states have internal predecessors, (6688), 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-01-19 03:10:06,126 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 209.0) internal successors, (6688), 32 states have internal predecessors, (6688), 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-01-19 03:10:06,126 INFO L186 Difference]: Start difference. First operand has 1052 places, 2623 transitions, 39767 flow. Second operand 31 states and 5386 transitions. [2022-01-19 03:10:06,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1082 places, 3021 transitions, 48817 flow [2022-01-19 03:10:30,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1082 places, 3021 transitions, 48379 flow, removed 219 selfloop flow, removed 0 redundant places. [2022-01-19 03:10:30,076 INFO L242 Difference]: Finished difference. Result has 1091 places, 2712 transitions, 42780 flow [2022-01-19 03:10:30,078 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=39419, PETRI_DIFFERENCE_MINUEND_PLACES=1052, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=772, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1839, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=42780, PETRI_PLACES=1091, PETRI_TRANSITIONS=2712} [2022-01-19 03:10:30,078 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 904 predicate places. [2022-01-19 03:10:30,078 INFO L470 AbstractCegarLoop]: Abstraction has has 1091 places, 2712 transitions, 42780 flow [2022-01-19 03:10:30,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 167.42105263157896) internal successors, (3181), 19 states have internal predecessors, (3181), 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-01-19 03:10:30,079 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:30,079 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:30,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:30,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:30,283 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:30,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1801975995, now seen corresponding path program 4 times [2022-01-19 03:10:30,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:30,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607455189] [2022-01-19 03:10:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:30,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:10:30,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:30,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607455189] [2022-01-19 03:10:30,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607455189] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:10:30,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840658775] [2022-01-19 03:10:30,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 03:10:30,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:30,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:30,543 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:30,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 03:10:30,621 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 03:10:30,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:10:30,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 03:10:30,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:31,119 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 03:10:31,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 10 [2022-01-19 03:10:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:10:31,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:10:31,539 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 03:10:31,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 11 [2022-01-19 03:10:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:10:32,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840658775] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:10:32,149 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:10:32,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2022-01-19 03:10:32,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50812142] [2022-01-19 03:10:32,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:10:32,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-19 03:10:32,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:32,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-19 03:10:32,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2022-01-19 03:10:32,152 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 209 [2022-01-19 03:10:32,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1091 places, 2712 transitions, 42780 flow. Second operand has 36 states, 36 states have (on average 88.5) internal successors, (3186), 36 states have internal predecessors, (3186), 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-01-19 03:10:32,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:32,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 209 [2022-01-19 03:10:32,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand