/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-After.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 15:23:11,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 15:23:11,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 15:23:12,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 15:23:12,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 15:23:12,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 15:23:12,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 15:23:12,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 15:23:12,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 15:23:12,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 15:23:12,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 15:23:12,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 15:23:12,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 15:23:12,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 15:23:12,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 15:23:12,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 15:23:12,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 15:23:12,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 15:23:12,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 15:23:12,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 15:23:12,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 15:23:12,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 15:23:12,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 15:23:12,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 15:23:12,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 15:23:12,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 15:23:12,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 15:23:12,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 15:23:12,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 15:23:12,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 15:23:12,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 15:23:12,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 15:23:12,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 15:23:12,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 15:23:12,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 15:23:12,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 15:23:12,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 15:23:12,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 15:23:12,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 15:23:12,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 15:23:12,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 15:23:12,073 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-After.epf [2022-01-19 15:23:12,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 15:23:12,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 15:23:12,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 15:23:12,104 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 15:23:12,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 15:23:12,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 15:23:12,105 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 15:23:12,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 15:23:12,105 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 15:23:12,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 15:23:12,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 15:23:12,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 15:23:12,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 15:23:12,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 15:23:12,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 15:23:12,107 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 15:23:12,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 15:23:12,107 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 15:23:12,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 15:23:12,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 15:23:12,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 15:23:12,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 15:23:12,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 15:23:12,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 15:23:12,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 15:23:12,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 15:23:12,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 15:23:12,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 15:23:12,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 15:23:12,109 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 15:23:12,109 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 15:23:12,110 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 15:23:12,110 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 15:23:12,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 15:23:12,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 15:23:12,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 15:23:12,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 15:23:12,347 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 15:23:12,348 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 15:23:12,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca63c209/eb56bca896fc429d917f216fd20e623a/FLAG0eec16096 [2022-01-19 15:23:12,712 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 15:23:12,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-01-19 15:23:12,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca63c209/eb56bca896fc429d917f216fd20e623a/FLAG0eec16096 [2022-01-19 15:23:13,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca63c209/eb56bca896fc429d917f216fd20e623a [2022-01-19 15:23:13,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 15:23:13,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 15:23:13,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 15:23:13,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 15:23:13,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 15:23:13,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13, skipping insertion in model container [2022-01-19 15:23:13,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 15:23:13,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 15:23:13,317 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 15:23:13,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 15:23:13,329 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 15:23:13,366 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 15:23:13,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 15:23:13,381 INFO L208 MainTranslator]: Completed translation [2022-01-19 15:23:13,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13 WrapperNode [2022-01-19 15:23:13,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 15:23:13,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 15:23:13,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 15:23:13,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 15:23:13,389 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:23:13" (1/1) ... [2022-01-19 15:23:13,404 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:23:13" (1/1) ... [2022-01-19 15:23:13,426 INFO L137 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 162 [2022-01-19 15:23:13,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 15:23:13,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 15:23:13,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 15:23:13,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 15:23:13,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 15:23:13,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 15:23:13,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 15:23:13,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 15:23:13,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13" (1/1) ... [2022-01-19 15:23:13,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 15:23:13,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:23:13,485 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 15:23:13,494 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 15:23:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 15:23:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 15:23:13,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 15:23:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 15:23:13,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 15:23:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 15:23:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 15:23:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 15:23:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 15:23:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 15:23:13,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 15:23:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 15:23:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 15:23:13,519 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 15:23:13,598 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 15:23:13,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 15:23:13,899 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 15:23:13,908 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 15:23:13,908 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 15:23:13,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:23:13 BoogieIcfgContainer [2022-01-19 15:23:13,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 15:23:13,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 15:23:13,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 15:23:13,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 15:23:13,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 03:23:13" (1/3) ... [2022-01-19 15:23:13,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ece86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:23:13, skipping insertion in model container [2022-01-19 15:23:13,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:23:13" (2/3) ... [2022-01-19 15:23:13,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ece86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:23:13, skipping insertion in model container [2022-01-19 15:23:13,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:23:13" (3/3) ... [2022-01-19 15:23:13,925 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2022-01-19 15:23:13,929 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 15:23:13,929 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 15:23:13,929 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 15:23:13,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,979 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,979 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,980 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,980 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,980 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 15:23:13,980 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 15:23:13,980 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 15:23:13,981 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 15:23:13,981 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 15:23:13,981 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 15:23:13,981 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 15:23:13,981 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 15:23:13,981 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 15:23:13,981 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 15:23:13,981 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 15:23:13,982 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 15:23:13,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,988 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,988 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,989 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,989 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,989 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,990 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,990 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,991 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 15:23:13,991 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 15:23:13,991 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 15:23:13,991 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 15:23:13,992 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,992 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,992 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,992 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,992 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 15:23:13,993 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 15:23:13,993 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 15:23:13,993 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 15:23:13,993 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 15:23:13,994 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 15:23:13,994 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 15:23:13,994 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 15:23:13,994 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 15:23:13,994 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 15:23:13,995 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 15:23:13,995 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 15:23:13,995 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 15:23:13,995 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 15:23:13,995 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 15:23:13,995 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 15:23:13,995 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 15:23:13,996 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 15:23:13,996 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 15:23:13,996 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 15:23:13,996 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 15:23:13,996 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 15:23:13,997 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 15:23:13,997 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 15:23:13,997 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 15:23:13,997 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 15:23:13,997 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 15:23:13,997 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 15:23:13,998 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 15:23:13,998 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 15:23:13,998 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 15:23:13,998 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 15:23:13,998 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,999 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,999 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:13,999 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,000 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,002 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,003 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,004 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,007 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 15:23:14,007 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 15:23:14,008 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 15:23:14,008 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 15:23:14,008 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 15:23:14,008 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 15:23:14,008 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 15:23:14,008 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 15:23:14,008 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 15:23:14,009 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 15:23:14,009 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 15:23:14,009 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 15:23:14,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,016 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,016 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,016 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 15:23:14,016 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 15:23:14,017 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 15:23:14,017 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 15:23:14,017 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 15:23:14,017 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 15:23:14,017 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 15:23:14,017 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 15:23:14,018 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 15:23:14,018 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 15:23:14,018 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 15:23:14,018 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 15:23:14,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,027 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 15:23:14,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,027 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,027 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 15:23:14,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,028 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,030 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,030 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,030 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,030 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,030 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,030 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,031 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 15:23:14,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,031 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 15:23:14,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,032 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:23:14,034 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 15:23:14,099 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 15:23:14,106 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 15:23:14,107 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 15:23:14,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 198 places, 209 transitions, 434 flow [2022-01-19 15:23:14,192 INFO L129 PetriNetUnfolder]: 18/207 cut-off events. [2022-01-19 15:23:14,192 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 15:23:14,199 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 15:23:14,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 209 transitions, 434 flow [2022-01-19 15:23:14,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 198 transitions, 408 flow [2022-01-19 15:23:14,239 INFO L129 PetriNetUnfolder]: 16/182 cut-off events. [2022-01-19 15:23:14,239 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 15:23:14,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:14,240 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 15:23:14,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:14,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -641401192, now seen corresponding path program 1 times [2022-01-19 15:23:14,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:14,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281516656] [2022-01-19 15:23:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:14,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 15:23:14,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:14,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281516656] [2022-01-19 15:23:14,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281516656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:14,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:14,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 15:23:14,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819665312] [2022-01-19 15:23:14,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:14,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 15:23:14,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:14,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 15:23:14,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 15:23:14,502 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 209 [2022-01-19 15:23:14,512 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 15:23:14,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:14,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 209 [2022-01-19 15:23:14,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:14,593 INFO L129 PetriNetUnfolder]: 5/185 cut-off events. [2022-01-19 15:23:14,594 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 15:23:14,596 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 15:23:14,597 INFO L132 encePairwiseOnDemand]: 196/209 looper letters, 4 selfloop transitions, 0 changer transitions 4/185 dead transitions. [2022-01-19 15:23:14,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 185 transitions, 390 flow [2022-01-19 15:23:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 15:23:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 15:23:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 399 transitions. [2022-01-19 15:23:14,615 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2022-01-19 15:23:14,616 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 399 transitions. [2022-01-19 15:23:14,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 399 transitions. [2022-01-19 15:23:14,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:14,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 399 transitions. [2022-01-19 15:23:14,625 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 15:23:14,630 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 15:23:14,631 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 15:23:14,633 INFO L186 Difference]: Start difference. First operand has 187 places, 198 transitions, 408 flow. Second operand 2 states and 399 transitions. [2022-01-19 15:23:14,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 185 transitions, 390 flow [2022-01-19 15:23:14,637 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 15:23:14,641 INFO L242 Difference]: Finished difference. Result has 184 places, 181 transitions, 366 flow [2022-01-19 15:23:14,643 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 15:23:14,646 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, -3 predicate places. [2022-01-19 15:23:14,647 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 181 transitions, 366 flow [2022-01-19 15:23:14,647 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 15:23:14,647 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:14,648 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 15:23:14,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 15:23:14,648 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 317017016, now seen corresponding path program 1 times [2022-01-19 15:23:14,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:14,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787697925] [2022-01-19 15:23:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:14,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:15,000 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 15:23:15,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:15,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787697925] [2022-01-19 15:23:15,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787697925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:15,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:15,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 15:23:15,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745940934] [2022-01-19 15:23:15,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:15,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 15:23:15,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:15,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 15:23:15,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 15:23:15,006 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 209 [2022-01-19 15:23:15,007 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 15:23:15,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:15,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 209 [2022-01-19 15:23:15,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:15,195 INFO L129 PetriNetUnfolder]: 153/760 cut-off events. [2022-01-19 15:23:15,195 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-01-19 15:23:15,199 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 15:23:15,204 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 39 selfloop transitions, 7 changer transitions 0/202 dead transitions. [2022-01-19 15:23:15,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 202 transitions, 502 flow [2022-01-19 15:23:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 15:23:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 15:23:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 727 transitions. [2022-01-19 15:23:15,209 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8696172248803827 [2022-01-19 15:23:15,209 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 727 transitions. [2022-01-19 15:23:15,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 727 transitions. [2022-01-19 15:23:15,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:15,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 727 transitions. [2022-01-19 15:23:15,213 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 15:23:15,216 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 15:23:15,217 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 15:23:15,217 INFO L186 Difference]: Start difference. First operand has 184 places, 181 transitions, 366 flow. Second operand 4 states and 727 transitions. [2022-01-19 15:23:15,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 202 transitions, 502 flow [2022-01-19 15:23:15,220 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 15:23:15,233 INFO L242 Difference]: Finished difference. Result has 185 places, 187 transitions, 413 flow [2022-01-19 15:23:15,234 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 15:23:15,235 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, -2 predicate places. [2022-01-19 15:23:15,235 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 187 transitions, 413 flow [2022-01-19 15:23:15,235 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 15:23:15,235 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:15,236 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 15:23:15,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 15:23:15,236 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:15,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash -299465594, now seen corresponding path program 1 times [2022-01-19 15:23:15,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:15,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802298278] [2022-01-19 15:23:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:15,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:15,426 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 15:23:15,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:15,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802298278] [2022-01-19 15:23:15,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802298278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:15,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:15,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 15:23:15,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818006609] [2022-01-19 15:23:15,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:15,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 15:23:15,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:15,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 15:23:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 15:23:15,432 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 15:23:15,433 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 15:23:15,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:15,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 15:23:15,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:15,779 INFO L129 PetriNetUnfolder]: 355/1781 cut-off events. [2022-01-19 15:23:15,779 INFO L130 PetriNetUnfolder]: For 193/195 co-relation queries the response was YES. [2022-01-19 15:23:15,785 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 15:23:15,794 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 82 selfloop transitions, 7 changer transitions 0/242 dead transitions. [2022-01-19 15:23:15,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 242 transitions, 770 flow [2022-01-19 15:23:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 15:23:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 15:23:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions. [2022-01-19 15:23:15,797 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8588516746411483 [2022-01-19 15:23:15,797 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions. [2022-01-19 15:23:15,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions. [2022-01-19 15:23:15,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:15,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions. [2022-01-19 15:23:15,801 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 15:23:15,803 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 15:23:15,804 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 15:23:15,804 INFO L186 Difference]: Start difference. First operand has 185 places, 187 transitions, 413 flow. Second operand 6 states and 1077 transitions. [2022-01-19 15:23:15,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 242 transitions, 770 flow [2022-01-19 15:23:15,809 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 15:23:15,815 INFO L242 Difference]: Finished difference. Result has 193 places, 191 transitions, 461 flow [2022-01-19 15:23:15,816 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 15:23:15,818 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 6 predicate places. [2022-01-19 15:23:15,818 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 191 transitions, 461 flow [2022-01-19 15:23:15,818 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 15:23:15,819 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:15,819 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 15:23:15,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 15:23:15,819 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:15,820 INFO L85 PathProgramCache]: Analyzing trace with hash 781561804, now seen corresponding path program 2 times [2022-01-19 15:23:15,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:15,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032142597] [2022-01-19 15:23:15,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:15,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:16,153 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 15:23:16,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:16,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032142597] [2022-01-19 15:23:16,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032142597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:16,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:16,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 15:23:16,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020452066] [2022-01-19 15:23:16,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:16,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 15:23:16,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:16,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 15:23:16,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-19 15:23:16,161 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 209 [2022-01-19 15:23:16,162 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 15:23:16,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:16,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 209 [2022-01-19 15:23:16,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:16,364 INFO L129 PetriNetUnfolder]: 183/1122 cut-off events. [2022-01-19 15:23:16,365 INFO L130 PetriNetUnfolder]: For 329/381 co-relation queries the response was YES. [2022-01-19 15:23:16,368 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 15:23:16,372 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 37 selfloop transitions, 11 changer transitions 3/208 dead transitions. [2022-01-19 15:23:16,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 208 transitions, 623 flow [2022-01-19 15:23:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 15:23:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 15:23:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 893 transitions. [2022-01-19 15:23:16,375 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8545454545454545 [2022-01-19 15:23:16,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 893 transitions. [2022-01-19 15:23:16,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 893 transitions. [2022-01-19 15:23:16,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:16,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 893 transitions. [2022-01-19 15:23:16,378 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 15:23:16,380 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 15:23:16,381 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 15:23:16,381 INFO L186 Difference]: Start difference. First operand has 193 places, 191 transitions, 461 flow. Second operand 5 states and 893 transitions. [2022-01-19 15:23:16,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 208 transitions, 623 flow [2022-01-19 15:23:16,385 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 15:23:16,388 INFO L242 Difference]: Finished difference. Result has 198 places, 192 transitions, 496 flow [2022-01-19 15:23:16,388 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 15:23:16,389 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 11 predicate places. [2022-01-19 15:23:16,389 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 192 transitions, 496 flow [2022-01-19 15:23:16,390 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 15:23:16,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:16,390 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 15:23:16,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 15:23:16,391 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:16,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash -119616610, now seen corresponding path program 1 times [2022-01-19 15:23:16,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:16,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612038438] [2022-01-19 15:23:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:16,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:16,624 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 15:23:16,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:16,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612038438] [2022-01-19 15:23:16,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612038438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:16,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:16,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 15:23:16,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467596747] [2022-01-19 15:23:16,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:16,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 15:23:16,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:16,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 15:23:16,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 15:23:16,628 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 15:23:16,629 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 15:23:16,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:16,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 15:23:16,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:16,920 INFO L129 PetriNetUnfolder]: 373/1941 cut-off events. [2022-01-19 15:23:16,920 INFO L130 PetriNetUnfolder]: For 807/819 co-relation queries the response was YES. [2022-01-19 15:23:16,927 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 15:23:16,934 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 80 selfloop transitions, 13 changer transitions 2/248 dead transitions. [2022-01-19 15:23:16,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 248 transitions, 935 flow [2022-01-19 15:23:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 15:23:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 15:23:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1082 transitions. [2022-01-19 15:23:16,937 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8628389154704944 [2022-01-19 15:23:16,938 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1082 transitions. [2022-01-19 15:23:16,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1082 transitions. [2022-01-19 15:23:16,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:16,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1082 transitions. [2022-01-19 15:23:16,941 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 15:23:16,943 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 15:23:16,944 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 15:23:16,944 INFO L186 Difference]: Start difference. First operand has 198 places, 192 transitions, 496 flow. Second operand 6 states and 1082 transitions. [2022-01-19 15:23:16,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 248 transitions, 935 flow [2022-01-19 15:23:16,949 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 15:23:16,952 INFO L242 Difference]: Finished difference. Result has 206 places, 200 transitions, 609 flow [2022-01-19 15:23:16,953 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 15:23:16,954 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 19 predicate places. [2022-01-19 15:23:16,954 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 609 flow [2022-01-19 15:23:16,954 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 15:23:16,954 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:16,954 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 15:23:16,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 15:23:16,955 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:16,955 INFO L85 PathProgramCache]: Analyzing trace with hash 527597564, now seen corresponding path program 2 times [2022-01-19 15:23:16,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:16,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166377057] [2022-01-19 15:23:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:16,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:17,126 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 15:23:17,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:17,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166377057] [2022-01-19 15:23:17,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166377057] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:17,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:17,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 15:23:17,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306108291] [2022-01-19 15:23:17,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:17,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 15:23:17,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:17,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 15:23:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 15:23:17,131 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 15:23:17,132 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 15:23:17,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:17,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 15:23:17,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:17,504 INFO L129 PetriNetUnfolder]: 394/2019 cut-off events. [2022-01-19 15:23:17,504 INFO L130 PetriNetUnfolder]: For 1472/1474 co-relation queries the response was YES. [2022-01-19 15:23:17,511 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 15:23:17,518 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 62 selfloop transitions, 18 changer transitions 0/233 dead transitions. [2022-01-19 15:23:17,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 233 transitions, 912 flow [2022-01-19 15:23:17,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 15:23:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 15:23:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2022-01-19 15:23:17,522 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2022-01-19 15:23:17,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1064 transitions. [2022-01-19 15:23:17,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1064 transitions. [2022-01-19 15:23:17,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:17,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1064 transitions. [2022-01-19 15:23:17,525 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 15:23:17,527 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 15:23:17,527 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 15:23:17,527 INFO L186 Difference]: Start difference. First operand has 206 places, 200 transitions, 609 flow. Second operand 6 states and 1064 transitions. [2022-01-19 15:23:17,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 233 transitions, 912 flow [2022-01-19 15:23:17,535 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 15:23:17,539 INFO L242 Difference]: Finished difference. Result has 211 places, 204 transitions, 682 flow [2022-01-19 15:23:17,539 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 15:23:17,542 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 24 predicate places. [2022-01-19 15:23:17,542 INFO L470 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 682 flow [2022-01-19 15:23:17,542 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 15:23:17,542 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:17,543 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 15:23:17,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 15:23:17,543 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:17,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:17,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1665551690, now seen corresponding path program 3 times [2022-01-19 15:23:17,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:17,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287773439] [2022-01-19 15:23:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:17,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:17,712 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 15:23:17,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:17,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287773439] [2022-01-19 15:23:17,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287773439] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:17,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:17,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 15:23:17,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656343231] [2022-01-19 15:23:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:17,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 15:23:17,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 15:23:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 15:23:17,719 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 15:23:17,720 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 15:23:17,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:17,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 15:23:17,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:18,147 INFO L129 PetriNetUnfolder]: 465/2340 cut-off events. [2022-01-19 15:23:18,148 INFO L130 PetriNetUnfolder]: For 2549/2551 co-relation queries the response was YES. [2022-01-19 15:23:18,158 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 15:23:18,168 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 74 selfloop transitions, 20 changer transitions 0/247 dead transitions. [2022-01-19 15:23:18,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 247 transitions, 1066 flow [2022-01-19 15:23:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 15:23:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 15:23:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1241 transitions. [2022-01-19 15:23:18,172 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.848257006151743 [2022-01-19 15:23:18,172 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1241 transitions. [2022-01-19 15:23:18,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1241 transitions. [2022-01-19 15:23:18,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:18,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1241 transitions. [2022-01-19 15:23:18,175 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 15:23:18,179 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 15:23:18,180 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 15:23:18,180 INFO L186 Difference]: Start difference. First operand has 211 places, 204 transitions, 682 flow. Second operand 7 states and 1241 transitions. [2022-01-19 15:23:18,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 247 transitions, 1066 flow [2022-01-19 15:23:18,188 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 15:23:18,191 INFO L242 Difference]: Finished difference. Result has 216 places, 206 transitions, 721 flow [2022-01-19 15:23:18,191 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 15:23:18,193 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 29 predicate places. [2022-01-19 15:23:18,193 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 206 transitions, 721 flow [2022-01-19 15:23:18,193 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 15:23:18,193 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:18,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] [2022-01-19 15:23:18,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 15:23:18,194 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash 21117964, now seen corresponding path program 4 times [2022-01-19 15:23:18,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:18,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066779406] [2022-01-19 15:23:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:18,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:18,273 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 15:23:18,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:18,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066779406] [2022-01-19 15:23:18,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066779406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:18,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:18,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 15:23:18,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30793466] [2022-01-19 15:23:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:18,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 15:23:18,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:18,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 15:23:18,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 15:23:18,276 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 15:23:18,276 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 15:23:18,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:18,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 15:23:18,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:18,633 INFO L129 PetriNetUnfolder]: 447/2285 cut-off events. [2022-01-19 15:23:18,633 INFO L130 PetriNetUnfolder]: For 2796/2798 co-relation queries the response was YES. [2022-01-19 15:23:18,642 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 15:23:18,650 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 75 selfloop transitions, 18 changer transitions 0/246 dead transitions. [2022-01-19 15:23:18,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 246 transitions, 1096 flow [2022-01-19 15:23:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 15:23:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 15:23:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 904 transitions. [2022-01-19 15:23:18,653 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8650717703349282 [2022-01-19 15:23:18,653 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 904 transitions. [2022-01-19 15:23:18,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 904 transitions. [2022-01-19 15:23:18,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:18,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 904 transitions. [2022-01-19 15:23:18,656 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 15:23:18,658 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 15:23:18,658 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 15:23:18,658 INFO L186 Difference]: Start difference. First operand has 216 places, 206 transitions, 721 flow. Second operand 5 states and 904 transitions. [2022-01-19 15:23:18,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 246 transitions, 1096 flow [2022-01-19 15:23:18,668 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 15:23:18,671 INFO L242 Difference]: Finished difference. Result has 218 places, 208 transitions, 760 flow [2022-01-19 15:23:18,672 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 15:23:18,674 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 31 predicate places. [2022-01-19 15:23:18,674 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 208 transitions, 760 flow [2022-01-19 15:23:18,675 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 15:23:18,675 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:18,675 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 15:23:18,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 15:23:18,675 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:18,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1070521520, now seen corresponding path program 5 times [2022-01-19 15:23:18,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:18,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812787476] [2022-01-19 15:23:18,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:18,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:18,759 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 15:23:18,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:18,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812787476] [2022-01-19 15:23:18,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812787476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:18,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:18,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 15:23:18,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197984164] [2022-01-19 15:23:18,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:18,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 15:23:18,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:18,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 15:23:18,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 15:23:18,761 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 15:23:18,762 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 15:23:18,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:18,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 15:23:18,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:19,081 INFO L129 PetriNetUnfolder]: 458/2294 cut-off events. [2022-01-19 15:23:19,081 INFO L130 PetriNetUnfolder]: For 2983/2986 co-relation queries the response was YES. [2022-01-19 15:23:19,091 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 15:23:19,101 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 64 selfloop transitions, 22 changer transitions 0/239 dead transitions. [2022-01-19 15:23:19,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 239 transitions, 1103 flow [2022-01-19 15:23:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 15:23:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 15:23:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 895 transitions. [2022-01-19 15:23:19,103 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8564593301435407 [2022-01-19 15:23:19,103 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 895 transitions. [2022-01-19 15:23:19,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 895 transitions. [2022-01-19 15:23:19,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:19,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 895 transitions. [2022-01-19 15:23:19,106 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 15:23:19,108 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 15:23:19,108 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 15:23:19,108 INFO L186 Difference]: Start difference. First operand has 218 places, 208 transitions, 760 flow. Second operand 5 states and 895 transitions. [2022-01-19 15:23:19,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 239 transitions, 1103 flow [2022-01-19 15:23:19,118 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 15:23:19,121 INFO L242 Difference]: Finished difference. Result has 223 places, 216 transitions, 893 flow [2022-01-19 15:23:19,121 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 15:23:19,122 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 36 predicate places. [2022-01-19 15:23:19,122 INFO L470 AbstractCegarLoop]: Abstraction has has 223 places, 216 transitions, 893 flow [2022-01-19 15:23:19,123 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 15:23:19,123 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:19,123 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 15:23:19,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 15:23:19,123 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:19,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 486915966, now seen corresponding path program 6 times [2022-01-19 15:23:19,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:19,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667838825] [2022-01-19 15:23:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:19,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:19,274 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 15:23:19,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:19,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667838825] [2022-01-19 15:23:19,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667838825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:19,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:23:19,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 15:23:19,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714405465] [2022-01-19 15:23:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:19,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 15:23:19,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:19,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 15:23:19,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 15:23:19,277 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 15:23:19,278 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 15:23:19,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:19,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 15:23:19,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:19,689 INFO L129 PetriNetUnfolder]: 444/2213 cut-off events. [2022-01-19 15:23:19,689 INFO L130 PetriNetUnfolder]: For 3403/3405 co-relation queries the response was YES. [2022-01-19 15:23:19,700 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 15:23:19,711 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 69 selfloop transitions, 24 changer transitions 0/246 dead transitions. [2022-01-19 15:23:19,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 246 transitions, 1190 flow [2022-01-19 15:23:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 15:23:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 15:23:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2022-01-19 15:23:19,714 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8532695374800638 [2022-01-19 15:23:19,714 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1070 transitions. [2022-01-19 15:23:19,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1070 transitions. [2022-01-19 15:23:19,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:19,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1070 transitions. [2022-01-19 15:23:19,718 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 15:23:19,720 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 15:23:19,720 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 15:23:19,720 INFO L186 Difference]: Start difference. First operand has 223 places, 216 transitions, 893 flow. Second operand 6 states and 1070 transitions. [2022-01-19 15:23:19,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 246 transitions, 1190 flow [2022-01-19 15:23:19,731 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 15:23:19,734 INFO L242 Difference]: Finished difference. Result has 230 places, 219 transitions, 964 flow [2022-01-19 15:23:19,735 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 15:23:19,735 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 43 predicate places. [2022-01-19 15:23:19,736 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 219 transitions, 964 flow [2022-01-19 15:23:19,736 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 15:23:19,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:19,736 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 15:23:19,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 15:23:19,737 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:19,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:19,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1410643597, now seen corresponding path program 1 times [2022-01-19 15:23:19,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:19,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655764436] [2022-01-19 15:23:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:19,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:19,909 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 15:23:19,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:19,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655764436] [2022-01-19 15:23:19,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655764436] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:23:19,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250380973] [2022-01-19 15:23:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:19,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:23:19,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:23:19,915 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 15:23:19,939 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 15:23:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:20,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-19 15:23:20,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:23:20,725 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 15:23:20,813 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 15:23:20,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:23:20,949 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 15:23:20,949 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 15:23:21,097 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 15:23:21,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250380973] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:23:21,097 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:23:21,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 9] total 23 [2022-01-19 15:23:21,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799939869] [2022-01-19 15:23:21,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:23:21,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 15:23:21,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:21,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 15:23:21,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-01-19 15:23:21,101 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 209 [2022-01-19 15:23:21,103 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 15:23:21,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:21,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 209 [2022-01-19 15:23:21,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:25,534 INFO L129 PetriNetUnfolder]: 7342/17187 cut-off events. [2022-01-19 15:23:25,534 INFO L130 PetriNetUnfolder]: For 20602/20602 co-relation queries the response was YES. [2022-01-19 15:23:25,609 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 15:23:25,668 INFO L132 encePairwiseOnDemand]: 177/209 looper letters, 666 selfloop transitions, 140 changer transitions 8/910 dead transitions. [2022-01-19 15:23:25,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 910 transitions, 5589 flow [2022-01-19 15:23:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-19 15:23:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-01-19 15:23:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 6228 transitions. [2022-01-19 15:23:25,682 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5730585204269415 [2022-01-19 15:23:25,682 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 6228 transitions. [2022-01-19 15:23:25,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 6228 transitions. [2022-01-19 15:23:25,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:25,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 6228 transitions. [2022-01-19 15:23:25,700 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 15:23:25,730 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 15:23:25,735 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 15:23:25,735 INFO L186 Difference]: Start difference. First operand has 230 places, 219 transitions, 964 flow. Second operand 52 states and 6228 transitions. [2022-01-19 15:23:25,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 910 transitions, 5589 flow [2022-01-19 15:23:25,806 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 15:23:25,815 INFO L242 Difference]: Finished difference. Result has 310 places, 362 transitions, 2066 flow [2022-01-19 15:23:25,816 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 15:23:25,816 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 123 predicate places. [2022-01-19 15:23:25,817 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 362 transitions, 2066 flow [2022-01-19 15:23:25,817 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 15:23:25,817 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:25,818 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 15:23:25,849 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 15:23:26,027 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 15:23:26,028 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:26,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1359667531, now seen corresponding path program 2 times [2022-01-19 15:23:26,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:26,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377081531] [2022-01-19 15:23:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:26,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:26,291 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 15:23:26,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:26,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377081531] [2022-01-19 15:23:26,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377081531] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:23:26,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754789656] [2022-01-19 15:23:26,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 15:23:26,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:23:26,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:23:26,296 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 15:23:26,298 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 15:23:26,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 15:23:26,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:23:26,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 15:23:26,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:23:26,756 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 15:23:26,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 15:23:26,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754789656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:26,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 15:23:26,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2022-01-19 15:23:26,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122103604] [2022-01-19 15:23:26,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:26,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 15:23:26,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:26,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 15:23:26,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-19 15:23:26,759 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 209 [2022-01-19 15:23:26,760 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 15:23:26,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:26,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 209 [2022-01-19 15:23:26,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:27,677 INFO L129 PetriNetUnfolder]: 1112/5337 cut-off events. [2022-01-19 15:23:27,677 INFO L130 PetriNetUnfolder]: For 9151/9242 co-relation queries the response was YES. [2022-01-19 15:23:27,711 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 15:23:27,727 INFO L132 encePairwiseOnDemand]: 188/209 looper letters, 94 selfloop transitions, 54 changer transitions 19/413 dead transitions. [2022-01-19 15:23:27,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 413 transitions, 2546 flow [2022-01-19 15:23:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 15:23:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 15:23:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1756 transitions. [2022-01-19 15:23:27,732 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7001594896331739 [2022-01-19 15:23:27,732 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1756 transitions. [2022-01-19 15:23:27,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1756 transitions. [2022-01-19 15:23:27,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:27,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1756 transitions. [2022-01-19 15:23:27,739 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 15:23:27,743 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 15:23:27,743 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 15:23:27,744 INFO L186 Difference]: Start difference. First operand has 310 places, 362 transitions, 2066 flow. Second operand 12 states and 1756 transitions. [2022-01-19 15:23:27,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 413 transitions, 2546 flow [2022-01-19 15:23:27,882 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 15:23:27,888 INFO L242 Difference]: Finished difference. Result has 314 places, 377 transitions, 2225 flow [2022-01-19 15:23:27,889 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 15:23:27,889 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 127 predicate places. [2022-01-19 15:23:27,890 INFO L470 AbstractCegarLoop]: Abstraction has has 314 places, 377 transitions, 2225 flow [2022-01-19 15:23:27,890 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 15:23:27,890 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:27,890 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 15:23:27,918 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 15:23:28,111 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 15:23:28,112 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2032396257, now seen corresponding path program 1 times [2022-01-19 15:23:28,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:28,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043386976] [2022-01-19 15:23:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:28,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:28,355 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 15:23:28,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:28,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043386976] [2022-01-19 15:23:28,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043386976] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:23:28,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850133749] [2022-01-19 15:23:28,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:28,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:23:28,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:23:28,357 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 15:23:28,358 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 15:23:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:28,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-19 15:23:28,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:23:29,006 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 15:23:29,093 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 15:23:29,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:23:29,203 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 15:23:29,203 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 15:23:29,361 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 15:23:29,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850133749] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:23:29,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:23:29,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 9] total 22 [2022-01-19 15:23:29,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008047865] [2022-01-19 15:23:29,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:23:29,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 15:23:29,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:29,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 15:23:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-01-19 15:23:29,365 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 209 [2022-01-19 15:23:29,366 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 15:23:29,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:29,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 209 [2022-01-19 15:23:29,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:33,955 INFO L129 PetriNetUnfolder]: 8548/19653 cut-off events. [2022-01-19 15:23:33,955 INFO L130 PetriNetUnfolder]: For 52327/52421 co-relation queries the response was YES. [2022-01-19 15:23:34,073 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 15:23:34,151 INFO L132 encePairwiseOnDemand]: 178/209 looper letters, 588 selfloop transitions, 208 changer transitions 4/899 dead transitions. [2022-01-19 15:23:34,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 899 transitions, 7137 flow [2022-01-19 15:23:34,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-19 15:23:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-01-19 15:23:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 7007 transitions. [2022-01-19 15:23:34,163 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5496117342536669 [2022-01-19 15:23:34,163 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 7007 transitions. [2022-01-19 15:23:34,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 7007 transitions. [2022-01-19 15:23:34,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:34,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 7007 transitions. [2022-01-19 15:23:34,176 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 15:23:34,192 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 15:23:34,194 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 15:23:34,194 INFO L186 Difference]: Start difference. First operand has 314 places, 377 transitions, 2225 flow. Second operand 61 states and 7007 transitions. [2022-01-19 15:23:34,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 899 transitions, 7137 flow [2022-01-19 15:23:34,501 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 15:23:34,511 INFO L242 Difference]: Finished difference. Result has 396 places, 539 transitions, 4662 flow [2022-01-19 15:23:34,512 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 15:23:34,513 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 209 predicate places. [2022-01-19 15:23:34,513 INFO L470 AbstractCegarLoop]: Abstraction has has 396 places, 539 transitions, 4662 flow [2022-01-19 15:23:34,514 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 15:23:34,514 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:34,514 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 15:23:34,531 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 15:23:34,717 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 15:23:34,717 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:34,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash -575446859, now seen corresponding path program 2 times [2022-01-19 15:23:34,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:34,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682978933] [2022-01-19 15:23:34,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:34,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:34,928 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 15:23:34,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:34,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682978933] [2022-01-19 15:23:34,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682978933] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:23:34,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586840439] [2022-01-19 15:23:34,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 15:23:34,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:23:34,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:23:34,931 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 15:23:34,932 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 15:23:35,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 15:23:35,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:23:35,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 15:23:35,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:23:35,673 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 15:23:35,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 15:23:35,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586840439] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:23:35,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 15:23:35,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-01-19 15:23:35,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767218214] [2022-01-19 15:23:35,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:23:35,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 15:23:35,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 15:23:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-19 15:23:35,676 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 209 [2022-01-19 15:23:35,676 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 15:23:35,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:35,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 209 [2022-01-19 15:23:35,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:36,528 INFO L129 PetriNetUnfolder]: 937/4709 cut-off events. [2022-01-19 15:23:36,528 INFO L130 PetriNetUnfolder]: For 19373/19544 co-relation queries the response was YES. [2022-01-19 15:23:36,568 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 15:23:36,585 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 81 selfloop transitions, 48 changer transitions 0/581 dead transitions. [2022-01-19 15:23:36,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 581 transitions, 5202 flow [2022-01-19 15:23:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 15:23:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 15:23:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1236 transitions. [2022-01-19 15:23:36,587 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8448393711551606 [2022-01-19 15:23:36,587 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1236 transitions. [2022-01-19 15:23:36,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1236 transitions. [2022-01-19 15:23:36,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:36,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1236 transitions. [2022-01-19 15:23:36,589 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 15:23:36,590 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 15:23:36,591 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 15:23:36,591 INFO L186 Difference]: Start difference. First operand has 396 places, 539 transitions, 4662 flow. Second operand 7 states and 1236 transitions. [2022-01-19 15:23:36,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 581 transitions, 5202 flow [2022-01-19 15:23:36,749 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 15:23:36,757 INFO L242 Difference]: Finished difference. Result has 394 places, 542 transitions, 4302 flow [2022-01-19 15:23:36,757 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 15:23:36,758 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 207 predicate places. [2022-01-19 15:23:36,758 INFO L470 AbstractCegarLoop]: Abstraction has has 394 places, 542 transitions, 4302 flow [2022-01-19 15:23:36,758 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 15:23:36,758 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:36,758 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 15:23:36,764 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 15:23:36,962 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 15:23:36,963 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1266164479, now seen corresponding path program 1 times [2022-01-19 15:23:36,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:36,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885745484] [2022-01-19 15:23:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:36,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:37,217 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 15:23:37,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:23:37,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885745484] [2022-01-19 15:23:37,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885745484] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:23:37,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537580929] [2022-01-19 15:23:37,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:37,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:23:37,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:23:37,219 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 15:23:37,221 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 15:23:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:23:37,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 15:23:37,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:23:38,660 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 15:23:38,660 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 15:23:38,854 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 15:23:38,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:23:39,182 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:23:39,183 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 15:23:40,307 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 15:23:40,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537580929] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:23:40,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:23:40,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 47 [2022-01-19 15:23:40,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250439204] [2022-01-19 15:23:40,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:23:40,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 15:23:40,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:23:40,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 15:23:40,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1958, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 15:23:40,312 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 209 [2022-01-19 15:23:40,315 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 15:23:40,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:23:40,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 209 [2022-01-19 15:23:40,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:23:57,603 INFO L129 PetriNetUnfolder]: 17676/37846 cut-off events. [2022-01-19 15:23:57,603 INFO L130 PetriNetUnfolder]: For 163093/163397 co-relation queries the response was YES. [2022-01-19 15:23:58,079 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 15:23:58,190 INFO L132 encePairwiseOnDemand]: 144/209 looper letters, 1131 selfloop transitions, 541 changer transitions 306/2110 dead transitions. [2022-01-19 15:23:58,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 2110 transitions, 17936 flow [2022-01-19 15:23:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-01-19 15:23:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2022-01-19 15:23:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 13768 transitions. [2022-01-19 15:23:58,208 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43339209267187107 [2022-01-19 15:23:58,209 INFO L72 ComplementDD]: Start complementDD. Operand 152 states and 13768 transitions. [2022-01-19 15:23:58,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 13768 transitions. [2022-01-19 15:23:58,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:23:58,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 152 states and 13768 transitions. [2022-01-19 15:23:58,235 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 15:23:58,277 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 15:23:58,287 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 15:23:58,287 INFO L186 Difference]: Start difference. First operand has 394 places, 542 transitions, 4302 flow. Second operand 152 states and 13768 transitions. [2022-01-19 15:23:58,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 2110 transitions, 17936 flow [2022-01-19 15:23:59,592 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 15:23:59,609 INFO L242 Difference]: Finished difference. Result has 635 places, 961 transitions, 9462 flow [2022-01-19 15:23:59,610 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 15:23:59,610 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 448 predicate places. [2022-01-19 15:23:59,610 INFO L470 AbstractCegarLoop]: Abstraction has has 635 places, 961 transitions, 9462 flow [2022-01-19 15:23:59,611 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 15:23:59,611 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:23:59,611 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 15:23:59,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-19 15:23:59,811 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 15:23:59,812 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:23:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:23:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash -443919373, now seen corresponding path program 2 times [2022-01-19 15:23:59,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:23:59,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521322480] [2022-01-19 15:23:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:23:59,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:23:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:24:00,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 15:24:00,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:24:00,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521322480] [2022-01-19 15:24:00,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521322480] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:24:00,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139708627] [2022-01-19 15:24:00,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 15:24:00,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:24:00,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:24:00,019 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 15:24:00,020 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 15:24:00,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 15:24:00,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:24:00,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-19 15:24:00,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:24:00,561 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 15:24:00,803 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 15:24:00,871 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 15:24:01,730 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 15:24:01,731 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 15:24:01,924 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 15:24:01,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:24:33,931 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:24:33,931 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 15:24:33,943 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:24:33,943 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 15:24:33,961 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:24:33,961 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 15:24:33,976 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:24:33,976 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 15:24:49,287 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 15:24:49,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139708627] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:24:49,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:24:49,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30, 27] total 61 [2022-01-19 15:24:49,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359386851] [2022-01-19 15:24:49,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:24:49,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-19 15:24:49,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:24:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-19 15:24:49,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3201, Unknown=114, NotChecked=0, Total=3660 [2022-01-19 15:24:49,290 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 209 [2022-01-19 15:24:49,292 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 15:24:49,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:24:49,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 209 [2022-01-19 15:24:49,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:25:12,976 INFO L129 PetriNetUnfolder]: 19477/42396 cut-off events. [2022-01-19 15:25:12,976 INFO L130 PetriNetUnfolder]: For 1482183/1482581 co-relation queries the response was YES. [2022-01-19 15:25:14,560 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 15:25:14,776 INFO L132 encePairwiseOnDemand]: 135/209 looper letters, 1347 selfloop transitions, 692 changer transitions 84/2245 dead transitions. [2022-01-19 15:25:14,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 2245 transitions, 31603 flow [2022-01-19 15:25:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-01-19 15:25:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2022-01-19 15:25:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 10101 transitions. [2022-01-19 15:25:14,788 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.36613745106568074 [2022-01-19 15:25:14,788 INFO L72 ComplementDD]: Start complementDD. Operand 132 states and 10101 transitions. [2022-01-19 15:25:14,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 10101 transitions. [2022-01-19 15:25:14,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:25:14,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 132 states and 10101 transitions. [2022-01-19 15:25:14,932 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 15:25:14,955 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 15:25:14,959 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 15:25:14,961 INFO L186 Difference]: Start difference. First operand has 635 places, 961 transitions, 9462 flow. Second operand 132 states and 10101 transitions. [2022-01-19 15:25:14,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 2245 transitions, 31603 flow [2022-01-19 15:25:20,576 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 15:25:20,599 INFO L242 Difference]: Finished difference. Result has 792 places, 1303 transitions, 15748 flow [2022-01-19 15:25:20,599 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 15:25:20,600 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 605 predicate places. [2022-01-19 15:25:20,600 INFO L470 AbstractCegarLoop]: Abstraction has has 792 places, 1303 transitions, 15748 flow [2022-01-19 15:25:20,601 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 15:25:20,601 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:25:20,601 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 15:25:20,608 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 15:25:20,806 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 15:25:20,806 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:25:20,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:25:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1960467287, now seen corresponding path program 1 times [2022-01-19 15:25:20,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:25:20,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109571472] [2022-01-19 15:25:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:25:20,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:25:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:25:20,994 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 15:25:20,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:25:20,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109571472] [2022-01-19 15:25:20,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109571472] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:25:20,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938062758] [2022-01-19 15:25:20,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:25:20,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:25:20,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:25:20,996 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 15:25:21,025 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 15:25:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:25:21,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 15:25:21,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:25:21,381 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 15:25:21,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:25:21,695 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 15:25:21,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938062758] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:25:21,695 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:25:21,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2022-01-19 15:25:21,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503301026] [2022-01-19 15:25:21,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:25:21,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 15:25:21,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:25:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 15:25:21,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-01-19 15:25:21,698 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2022-01-19 15:25:21,700 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 15:25:21,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:25:21,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2022-01-19 15:25:21,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:25:33,188 INFO L129 PetriNetUnfolder]: 6033/25718 cut-off events. [2022-01-19 15:25:33,188 INFO L130 PetriNetUnfolder]: For 1024327/1040762 co-relation queries the response was YES. [2022-01-19 15:25:34,242 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 15:25:34,361 INFO L132 encePairwiseOnDemand]: 187/209 looper letters, 340 selfloop transitions, 477 changer transitions 10/1708 dead transitions. [2022-01-19 15:25:34,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 812 places, 1708 transitions, 23273 flow [2022-01-19 15:25:34,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 15:25:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 15:25:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5176 transitions. [2022-01-19 15:25:34,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.825518341307815 [2022-01-19 15:25:34,368 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5176 transitions. [2022-01-19 15:25:34,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5176 transitions. [2022-01-19 15:25:34,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:25:34,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5176 transitions. [2022-01-19 15:25:34,375 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 15:25:34,380 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 15:25:34,380 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 15:25:34,380 INFO L186 Difference]: Start difference. First operand has 792 places, 1303 transitions, 15748 flow. Second operand 30 states and 5176 transitions. [2022-01-19 15:25:34,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 812 places, 1708 transitions, 23273 flow [2022-01-19 15:25:40,063 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 15:25:40,086 INFO L242 Difference]: Finished difference. Result has 795 places, 1524 transitions, 19061 flow [2022-01-19 15:25:40,087 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 15:25:40,087 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 608 predicate places. [2022-01-19 15:25:40,087 INFO L470 AbstractCegarLoop]: Abstraction has has 795 places, 1524 transitions, 19061 flow [2022-01-19 15:25:40,088 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 15:25:40,088 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:25:40,088 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 15:25:40,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-19 15:25:40,296 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 15:25:40,296 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:25:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:25:40,297 INFO L85 PathProgramCache]: Analyzing trace with hash 337846925, now seen corresponding path program 3 times [2022-01-19 15:25:40,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:25:40,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999097534] [2022-01-19 15:25:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:25:40,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:25:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:25:40,495 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 15:25:40,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:25:40,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999097534] [2022-01-19 15:25:40,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999097534] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:25:40,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766618449] [2022-01-19 15:25:40,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 15:25:40,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:25:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:25:40,496 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 15:25:40,497 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 15:25:40,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 15:25:40,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:25:40,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-19 15:25:40,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:25:41,591 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 15:25:41,592 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 15:25:41,705 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 15:25:41,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:25:42,247 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:25:42,248 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 15:25:43,659 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 15:25:43,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766618449] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:25:43,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:25:43,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 22] total 46 [2022-01-19 15:25:43,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583356294] [2022-01-19 15:25:43,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:25:43,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 15:25:43,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:25:43,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 15:25:43,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1901, Unknown=0, NotChecked=0, Total=2070 [2022-01-19 15:25:43,664 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 209 [2022-01-19 15:25:43,667 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 15:25:43,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:25:43,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 209 [2022-01-19 15:25:43,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:26:43,444 INFO L129 PetriNetUnfolder]: 35420/82717 cut-off events. [2022-01-19 15:26:43,445 INFO L130 PetriNetUnfolder]: For 5859006/5859689 co-relation queries the response was YES. [2022-01-19 15:26:49,064 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 15:26:49,545 INFO L132 encePairwiseOnDemand]: 147/209 looper letters, 2000 selfloop transitions, 1321 changer transitions 154/3627 dead transitions. [2022-01-19 15:26:49,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 3627 transitions, 60088 flow [2022-01-19 15:26:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-01-19 15:26:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2022-01-19 15:26:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 14556 transitions. [2022-01-19 15:26:49,559 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4246703232582565 [2022-01-19 15:26:49,560 INFO L72 ComplementDD]: Start complementDD. Operand 164 states and 14556 transitions. [2022-01-19 15:26:49,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 14556 transitions. [2022-01-19 15:26:49,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:26:49,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 164 states and 14556 transitions. [2022-01-19 15:26:49,578 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 15:26:49,606 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 15:26:49,612 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 15:26:49,613 INFO L186 Difference]: Start difference. First operand has 795 places, 1524 transitions, 19061 flow. Second operand 164 states and 14556 transitions. [2022-01-19 15:26:49,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 3627 transitions, 60088 flow [2022-01-19 15:27:22,778 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 15:27:22,822 INFO L242 Difference]: Finished difference. Result has 1031 places, 2312 transitions, 33729 flow [2022-01-19 15:27:22,824 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 15:27:22,824 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 844 predicate places. [2022-01-19 15:27:22,824 INFO L470 AbstractCegarLoop]: Abstraction has has 1031 places, 2312 transitions, 33729 flow [2022-01-19 15:27:22,825 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 15:27:22,825 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:27:22,825 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 15:27:22,832 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 15:27:23,027 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 15:27:23,027 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:27:23,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:27:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2141440705, now seen corresponding path program 2 times [2022-01-19 15:27:23,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:27:23,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264609031] [2022-01-19 15:27:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:27:23,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:27:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:27:23,222 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 15:27:23,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:27:23,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264609031] [2022-01-19 15:27:23,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264609031] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:27:23,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599819778] [2022-01-19 15:27:23,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 15:27:23,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:27:23,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:27:23,228 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 15:27:23,230 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 15:27:23,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 15:27:23,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:27:23,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 15:27:23,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:27:23,701 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 15:27:23,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:27:23,980 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 15:27:23,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599819778] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:27:23,981 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:27:23,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-01-19 15:27:23,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179435029] [2022-01-19 15:27:23,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:27:23,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 15:27:23,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:27:23,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 15:27:23,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-01-19 15:27:23,984 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2022-01-19 15:27:23,985 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 15:27:23,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:27:23,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2022-01-19 15:27:23,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:27:48,160 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 15:27:48,163 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-01-19 15:27:48,163 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 15:27:48,163 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-01-19 15:27:48,163 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 15:27:53,091 INFO L129 PetriNetUnfolder]: 10118/46247 cut-off events. [2022-01-19 15:27:53,092 INFO L130 PetriNetUnfolder]: For 2162749/2185545 co-relation queries the response was YES. [2022-01-19 15:27:56,991 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 15:27:57,196 INFO L132 encePairwiseOnDemand]: 192/209 looper letters, 684 selfloop transitions, 657 changer transitions 0/2827 dead transitions. [2022-01-19 15:27:57,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1063 places, 2827 transitions, 45204 flow [2022-01-19 15:27:57,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 15:27:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 15:27:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 7521 transitions. [2022-01-19 15:27:57,202 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8178555893866899 [2022-01-19 15:27:57,202 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 7521 transitions. [2022-01-19 15:27:57,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 7521 transitions. [2022-01-19 15:27:57,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:27:57,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 7521 transitions. [2022-01-19 15:27:57,212 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 15:27:57,218 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 15:27:57,219 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 15:27:57,219 INFO L186 Difference]: Start difference. First operand has 1031 places, 2312 transitions, 33729 flow. Second operand 44 states and 7521 transitions. [2022-01-19 15:27:57,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1063 places, 2827 transitions, 45204 flow [2022-01-19 15:28:18,920 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 15:28:18,965 INFO L242 Difference]: Finished difference. Result has 1052 places, 2623 transitions, 39767 flow [2022-01-19 15:28:18,967 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 15:28:18,967 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 865 predicate places. [2022-01-19 15:28:18,967 INFO L470 AbstractCegarLoop]: Abstraction has has 1052 places, 2623 transitions, 39767 flow [2022-01-19 15:28:18,968 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 15:28:18,968 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:28:18,968 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 15:28:18,996 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 15:28:19,194 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 15:28:19,195 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:28:19,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:28:19,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1222766085, now seen corresponding path program 3 times [2022-01-19 15:28:19,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:28:19,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867954179] [2022-01-19 15:28:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:28:19,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:28:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:28:19,307 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 15:28:19,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:28:19,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867954179] [2022-01-19 15:28:19,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867954179] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:28:19,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861003052] [2022-01-19 15:28:19,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 15:28:19,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:28:19,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:28:19,309 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 15:28:19,310 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 15:28:19,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 15:28:19,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:28:19,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 15:28:19,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:28:19,710 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 15:28:19,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:28:19,958 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 15:28:19,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861003052] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:28:19,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:28:19,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 15:28:19,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052965728] [2022-01-19 15:28:19,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:28:19,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 15:28:19,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:28:19,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 15:28:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-01-19 15:28:19,961 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2022-01-19 15:28:19,962 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 15:28:19,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:28:19,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2022-01-19 15:28:19,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:28:46,058 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 15:28:46,059 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-01-19 15:28:46,059 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-01-19 15:28:46,059 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 15:28:46,059 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 15:28:51,585 INFO L129 PetriNetUnfolder]: 10491/47513 cut-off events. [2022-01-19 15:28:51,585 INFO L130 PetriNetUnfolder]: For 2259809/2285162 co-relation queries the response was YES. [2022-01-19 15:28:55,791 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 15:28:56,011 INFO L132 encePairwiseOnDemand]: 188/209 looper letters, 675 selfloop transitions, 847 changer transitions 14/3021 dead transitions. [2022-01-19 15:28:56,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1082 places, 3021 transitions, 48817 flow [2022-01-19 15:28:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 15:28:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 15:28:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5386 transitions. [2022-01-19 15:28:56,015 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.831301126717086 [2022-01-19 15:28:56,015 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5386 transitions. [2022-01-19 15:28:56,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5386 transitions. [2022-01-19 15:28:56,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:28:56,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5386 transitions. [2022-01-19 15:28:56,022 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 15:28:56,026 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 15:28:56,026 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 15:28:56,026 INFO L186 Difference]: Start difference. First operand has 1052 places, 2623 transitions, 39767 flow. Second operand 31 states and 5386 transitions. [2022-01-19 15:28:56,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1082 places, 3021 transitions, 48817 flow [2022-01-19 15:29:19,541 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 15:29:19,585 INFO L242 Difference]: Finished difference. Result has 1091 places, 2712 transitions, 42780 flow [2022-01-19 15:29:19,587 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 15:29:19,588 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 904 predicate places. [2022-01-19 15:29:19,588 INFO L470 AbstractCegarLoop]: Abstraction has has 1091 places, 2712 transitions, 42780 flow [2022-01-19 15:29:19,588 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 15:29:19,588 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:29:19,588 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 15:29:19,606 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 15:29:19,797 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 15:29:19,797 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 15:29:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:29:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1801975995, now seen corresponding path program 4 times [2022-01-19 15:29:19,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:29:19,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415248198] [2022-01-19 15:29:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:29:19,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:29:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:29:20,030 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 15:29:20,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:29:20,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415248198] [2022-01-19 15:29:20,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415248198] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:29:20,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563164850] [2022-01-19 15:29:20,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 15:29:20,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:29:20,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:29:20,032 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 15:29:20,033 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 15:29:20,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 15:29:20,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:29:20,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 15:29:20,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:29:20,661 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 15:29:20,661 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 15:29:20,748 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 15:29:20,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:29:21,082 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 15:29:21,082 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 15:29:21,767 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 15:29:21,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563164850] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:29:21,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:29:21,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2022-01-19 15:29:21,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669703239] [2022-01-19 15:29:21,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:29:21,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-19 15:29:21,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:29:21,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-19 15:29:21,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2022-01-19 15:29:21,770 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 209 [2022-01-19 15:29:21,772 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 15:29:21,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:29:21,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 209 [2022-01-19 15:29:21,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand