/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:21:34,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:21:34,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:21:34,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:21:34,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:21:34,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:21:34,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:21:34,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:21:34,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:21:34,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:21:34,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:21:34,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:21:34,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:21:34,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:21:34,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:21:34,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:21:34,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:21:34,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:21:34,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:21:34,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:21:34,193 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:21:34,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:21:34,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:21:34,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:21:34,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:21:34,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:21:34,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:21:34,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:21:34,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:21:34,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:21:34,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:21:34,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:21:34,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:21:34,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:21:34,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:21:34,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:21:34,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:21:34,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:21:34,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:21:34,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:21:34,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:21:34,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:21:34,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:21:34,238 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:21:34,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:21:34,239 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:21:34,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:21:34,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:21:34,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:21:34,243 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:21:34,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:21:34,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:21:34,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:21:34,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:21:34,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:21:34,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:21:34,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:21:34,244 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:21:34,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:21:34,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:21:34,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:21:34,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:21:34,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:21:34,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:21:34,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:21:34,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:21:34,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:21:34,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:21:34,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:21:34,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:21:34,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:21:34,248 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:21:34,248 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 22:21:34,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:21:34,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:21:34,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:21:34,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:21:34,466 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:21:34,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-07 22:21:34,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce50d983/4d8e373e19324e6c83146ec27f6a509c/FLAG29b5aad9d [2022-04-07 22:21:34,909 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:21:34,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-07 22:21:34,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce50d983/4d8e373e19324e6c83146ec27f6a509c/FLAG29b5aad9d [2022-04-07 22:21:34,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce50d983/4d8e373e19324e6c83146ec27f6a509c [2022-04-07 22:21:34,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:21:34,931 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:21:34,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:21:34,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:21:34,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:21:34,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:21:34" (1/1) ... [2022-04-07 22:21:34,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b41977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:34, skipping insertion in model container [2022-04-07 22:21:34,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:21:34" (1/1) ... [2022-04-07 22:21:34,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:21:34,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:21:35,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-07 22:21:35,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:21:35,136 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:21:35,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-07 22:21:35,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:21:35,185 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:21:35,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35 WrapperNode [2022-04-07 22:21:35,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:21:35,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:21:35,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:21:35,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:21:35,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35" (1/1) ... [2022-04-07 22:21:35,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35" (1/1) ... [2022-04-07 22:21:35,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35" (1/1) ... [2022-04-07 22:21:35,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35" (1/1) ... [2022-04-07 22:21:35,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35" (1/1) ... [2022-04-07 22:21:35,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35" (1/1) ... [2022-04-07 22:21:35,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35" (1/1) ... [2022-04-07 22:21:35,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:21:35,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:21:35,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:21:35,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:21:35,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35" (1/1) ... [2022-04-07 22:21:35,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:21:35,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:21:35,244 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-04-07 22:21:35,268 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-04-07 22:21:35,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:21:35,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:21:35,284 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:21:35,284 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:21:35,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:21:35,284 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:21:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:21:35,285 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 22:21:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 22:21:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:21:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:21:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:21:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:21:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 22:21:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:21:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:21:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:21:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:21:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:21:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:21:35,365 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:21:35,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:21:35,485 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:21:35,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:21:35,492 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 22:21:35,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:21:35 BoogieIcfgContainer [2022-04-07 22:21:35,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:21:35,495 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:21:35,495 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:21:35,496 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:21:35,502 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:21:35" (1/1) ... [2022-04-07 22:21:35,504 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:21:35,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:21:35 BasicIcfg [2022-04-07 22:21:35,527 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:21:35,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:21:35,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:21:35,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:21:35,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:21:34" (1/4) ... [2022-04-07 22:21:35,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8eeb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:21:35, skipping insertion in model container [2022-04-07 22:21:35,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:21:35" (2/4) ... [2022-04-07 22:21:35,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8eeb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:21:35, skipping insertion in model container [2022-04-07 22:21:35,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:21:35" (3/4) ... [2022-04-07 22:21:35,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8eeb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:21:35, skipping insertion in model container [2022-04-07 22:21:35,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:21:35" (4/4) ... [2022-04-07 22:21:35,549 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.iqvasr [2022-04-07 22:21:35,553 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:21:35,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:21:35,624 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:21:35,631 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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 [2022-04-07 22:21:35,631 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:21:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 22:21:35,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:21:35,651 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:21:35,651 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:21:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:21:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1599893512, now seen corresponding path program 1 times [2022-04-07 22:21:35,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:21:35,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107817815] [2022-04-07 22:21:35,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:21:35,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:21:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:35,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:21:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:35,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30#true} is VALID [2022-04-07 22:21:35,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 22:21:35,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 22:21:35,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:21:35,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30#true} is VALID [2022-04-07 22:21:35,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 22:21:35,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 22:21:35,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#true} is VALID [2022-04-07 22:21:35,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {30#true} is VALID [2022-04-07 22:21:35,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#true} [76] L32-3-->L32-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 22:21:35,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {31#false} is VALID [2022-04-07 22:21:35,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 22:21:35,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {31#false} is VALID [2022-04-07 22:21:35,808 INFO L272 TraceCheckUtils]: 10: Hoare triple {31#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {31#false} is VALID [2022-04-07 22:21:35,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {31#false} is VALID [2022-04-07 22:21:35,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 22:21:35,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#false} is VALID [2022-04-07 22:21:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:21:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107817815] [2022-04-07 22:21:35,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107817815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:21:35,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:21:35,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 22:21:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365697889] [2022-04-07 22:21:35,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:21:35,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 22:21:35,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:21:35,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:35,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:35,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 22:21:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:21:35,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 22:21:35,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:21:35,888 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:35,991 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-07 22:21:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 22:21:35,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 22:21:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:21:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-07 22:21:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-07 22:21:36,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-07 22:21:36,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:36,090 INFO L225 Difference]: With dead ends: 46 [2022-04-07 22:21:36,091 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 22:21:36,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:21:36,100 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:21:36,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:21:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 22:21:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-07 22:21:36,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:21:36,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:21:36,137 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:21:36,137 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:21:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:36,146 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-07 22:21:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-07 22:21:36,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:36,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:36,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-07 22:21:36,149 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-07 22:21:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:36,153 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-07 22:21:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-07 22:21:36,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:36,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:36,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:21:36,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:21:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:21:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-07 22:21:36,168 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-07 22:21:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:21:36,168 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-07 22:21:36,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-07 22:21:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 22:21:36,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:21:36,169 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:21:36,170 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:21:36,170 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:21:36,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:21:36,171 INFO L85 PathProgramCache]: Analyzing trace with hash -952263449, now seen corresponding path program 1 times [2022-04-07 22:21:36,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:21:36,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172937432] [2022-04-07 22:21:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:21:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:21:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:36,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:21:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:36,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {172#true} is VALID [2022-04-07 22:21:36,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-07 22:21:36,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172#true} {172#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-07 22:21:36,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:21:36,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {172#true} is VALID [2022-04-07 22:21:36,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-07 22:21:36,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-07 22:21:36,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-07 22:21:36,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {177#(= main_~index~0 0)} is VALID [2022-04-07 22:21:36,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {177#(= main_~index~0 0)} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-07 22:21:36,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {173#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {173#false} is VALID [2022-04-07 22:21:36,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {173#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-07 22:21:36,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {173#false} is VALID [2022-04-07 22:21:36,243 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {173#false} is VALID [2022-04-07 22:21:36,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {173#false} is VALID [2022-04-07 22:21:36,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-07 22:21:36,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-07 22:21:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:36,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:21:36,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172937432] [2022-04-07 22:21:36,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172937432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:21:36,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:21:36,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:21:36,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582036184] [2022-04-07 22:21:36,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:21:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 22:21:36,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:21:36,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:36,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:36,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:21:36,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:21:36,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:21:36,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:21:36,261 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:36,426 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-07 22:21:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:21:36,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 22:21:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:21:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-07 22:21:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-07 22:21:36,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-07 22:21:36,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:36,487 INFO L225 Difference]: With dead ends: 43 [2022-04-07 22:21:36,487 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 22:21:36,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 22:21:36,495 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:21:36,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:21:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 22:21:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-07 22:21:36,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:21:36,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:21:36,505 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:21:36,505 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:21:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:36,510 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-07 22:21:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 22:21:36,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:36,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:36,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-07 22:21:36,514 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-07 22:21:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:36,517 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-07 22:21:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 22:21:36,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:36,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:36,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:21:36,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:21:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:21:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-07 22:21:36,526 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-07 22:21:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:21:36,526 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-07 22:21:36,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 22:21:36,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 22:21:36,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:21:36,528 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:21:36,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:21:36,528 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:21:36,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:21:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1051990743, now seen corresponding path program 1 times [2022-04-07 22:21:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:21:36,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899422347] [2022-04-07 22:21:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:21:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:21:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:36,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:21:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:36,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {336#true} is VALID [2022-04-07 22:21:36,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:36,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {336#true} {336#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:36,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {336#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:21:36,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {336#true} is VALID [2022-04-07 22:21:36,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:36,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:36,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {336#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:36,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {336#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {341#(= main_~index~0 0)} is VALID [2022-04-07 22:21:36,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {341#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {341#(= main_~index~0 0)} is VALID [2022-04-07 22:21:36,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {341#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {342#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:21:36,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {337#false} is VALID [2022-04-07 22:21:36,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {337#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {337#false} is VALID [2022-04-07 22:21:36,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {337#false} is VALID [2022-04-07 22:21:36,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {337#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {337#false} is VALID [2022-04-07 22:21:36,697 INFO L272 TraceCheckUtils]: 12: Hoare triple {337#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {337#false} is VALID [2022-04-07 22:21:36,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {337#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {337#false} is VALID [2022-04-07 22:21:36,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {337#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {337#false} is VALID [2022-04-07 22:21:36,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {337#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#false} is VALID [2022-04-07 22:21:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:21:36,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899422347] [2022-04-07 22:21:36,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899422347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:21:36,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416842902] [2022-04-07 22:21:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:21:36,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:21:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:21:36,708 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-04-07 22:21:36,742 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-04-07 22:21:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:36,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 22:21:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:36,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:21:36,863 INFO L390 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 11 treesize of output 7 [2022-04-07 22:21:36,985 INFO L390 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-04-07 22:21:37,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {336#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:37,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {336#true} is VALID [2022-04-07 22:21:37,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:37,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:37,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {336#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:37,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {336#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {341#(= main_~index~0 0)} is VALID [2022-04-07 22:21:37,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {341#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {365#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-07 22:21:37,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {365#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-07 22:21:37,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {365#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-07 22:21:37,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {375#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:21:37,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {375#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {375#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:21:37,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {375#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {382#(= |main_#t~mem3| 0)} is VALID [2022-04-07 22:21:37,049 INFO L272 TraceCheckUtils]: 12: Hoare triple {382#(= |main_#t~mem3| 0)} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {386#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:21:37,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {390#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:21:37,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {390#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {337#false} is VALID [2022-04-07 22:21:37,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {337#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#false} is VALID [2022-04-07 22:21:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:37,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:21:37,263 INFO L390 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 20 treesize of output 18 [2022-04-07 22:21:37,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-04-07 22:21:37,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {337#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#false} is VALID [2022-04-07 22:21:37,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {390#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {337#false} is VALID [2022-04-07 22:21:37,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {390#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:21:37,361 INFO L272 TraceCheckUtils]: 12: Hoare triple {406#(= (mod |main_#t~mem3| 4294967296) 0)} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {386#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:21:37,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {410#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {406#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-07 22:21:37,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {410#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {410#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-07 22:21:37,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {410#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-07 22:21:37,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {417#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-07 22:21:37,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {417#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {417#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-07 22:21:37,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {427#(= (* (mod main_~index~0 4294967296) 4) 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {417#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-07 22:21:37,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {336#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {427#(= (* (mod main_~index~0 4294967296) 4) 0)} is VALID [2022-04-07 22:21:37,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {336#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:37,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {336#true} {336#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:37,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:37,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {336#true} is VALID [2022-04-07 22:21:37,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {336#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#true} is VALID [2022-04-07 22:21:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:37,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416842902] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:21:37,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:21:37,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 14 [2022-04-07 22:21:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969956350] [2022-04-07 22:21:37,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:21:37,373 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 22:21:37,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:21:37,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:37,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:37,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 22:21:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:21:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 22:21:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 22:21:37,422 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:38,082 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-07 22:21:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 22:21:38,082 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 22:21:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:21:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-07 22:21:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-07 22:21:38,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-07 22:21:38,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:38,156 INFO L225 Difference]: With dead ends: 57 [2022-04-07 22:21:38,156 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 22:21:38,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-04-07 22:21:38,157 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 22:21:38,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 22:21:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 22:21:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-07 22:21:38,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:21:38,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:38,173 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:38,173 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:38,176 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 22:21:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 22:21:38,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:38,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:38,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-07 22:21:38,177 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-07 22:21:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:38,179 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 22:21:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 22:21:38,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:38,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:38,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:21:38,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:21:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-07 22:21:38,182 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2022-04-07 22:21:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:21:38,182 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-07 22:21:38,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:21:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-07 22:21:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 22:21:38,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:21:38,183 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:21:38,208 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-04-07 22:21:38,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:21:38,400 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:21:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:21:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1683413027, now seen corresponding path program 1 times [2022-04-07 22:21:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:21:38,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369749436] [2022-04-07 22:21:38,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:21:38,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:21:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:21:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:38,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {687#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {675#true} is VALID [2022-04-07 22:21:38,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:38,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {675#true} {675#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-07 22:21:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:38,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {675#true} is VALID [2022-04-07 22:21:38,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:38,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:38,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {676#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {676#false} is VALID [2022-04-07 22:21:38,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:21:38,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {675#true} is VALID [2022-04-07 22:21:38,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:38,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:38,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:38,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {680#(= main_~index~0 0)} is VALID [2022-04-07 22:21:38,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {680#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {680#(= main_~index~0 0)} is VALID [2022-04-07 22:21:38,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {681#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:21:38,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {681#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {681#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:21:38,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {682#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:21:38,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {682#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-07 22:21:38,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {676#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {676#false} is VALID [2022-04-07 22:21:38,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {676#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-07 22:21:38,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {676#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {676#false} is VALID [2022-04-07 22:21:38,512 INFO L272 TraceCheckUtils]: 14: Hoare triple {676#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {675#true} is VALID [2022-04-07 22:21:38,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {675#true} is VALID [2022-04-07 22:21:38,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {675#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:38,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {675#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:38,512 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {675#true} {676#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {676#false} is VALID [2022-04-07 22:21:38,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {676#false} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {676#false} is VALID [2022-04-07 22:21:38,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {676#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {676#false} is VALID [2022-04-07 22:21:38,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {676#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-07 22:21:38,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {676#false} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {676#false} is VALID [2022-04-07 22:21:38,513 INFO L272 TraceCheckUtils]: 23: Hoare triple {676#false} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {676#false} is VALID [2022-04-07 22:21:38,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {676#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {676#false} is VALID [2022-04-07 22:21:38,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {676#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-07 22:21:38,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {676#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-07 22:21:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 22:21:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:21:38,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369749436] [2022-04-07 22:21:38,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369749436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:21:38,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798308262] [2022-04-07 22:21:38,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:21:38,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:21:38,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:21:38,516 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-04-07 22:21:38,520 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-04-07 22:21:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:38,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 22:21:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:38,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:21:38,657 INFO L390 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 19 treesize of output 15 [2022-04-07 22:21:42,364 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-04-07 22:21:42,364 INFO L390 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 27 treesize of output 10 [2022-04-07 22:21:43,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {675#true} is VALID [2022-04-07 22:21:43,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {680#(= main_~index~0 0)} is VALID [2022-04-07 22:21:43,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {680#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {680#(= main_~index~0 0)} is VALID [2022-04-07 22:21:43,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {681#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:21:43,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {681#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {715#(exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} is VALID [2022-04-07 22:21:43,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#(exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {715#(exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} is VALID [2022-04-07 22:21:43,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {715#(exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {715#(exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} is VALID [2022-04-07 22:21:43,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {715#(exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} is VALID [2022-04-07 22:21:43,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} is VALID [2022-04-07 22:21:43,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} is VALID [2022-04-07 22:21:43,088 INFO L272 TraceCheckUtils]: 14: Hoare triple {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {735#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} is VALID [2022-04-07 22:21:43,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {735#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {735#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} is VALID [2022-04-07 22:21:43,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {735#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {735#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} is VALID [2022-04-07 22:21:43,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {735#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} is VALID [2022-04-07 22:21:43,093 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {735#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_1| Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) (+ |v_main_~#array~0.offset_BEFORE_CALL_1| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21))))} {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} is VALID [2022-04-07 22:21:43,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} is VALID [2022-04-07 22:21:43,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {725#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {754#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 1))} is VALID [2022-04-07 22:21:43,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {754#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 1))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {754#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 1))} is VALID [2022-04-07 22:21:43,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {754#(and (exists ((aux_div_main_~index~0_21 Int) (aux_mod_main_~index~0_21 Int)) (and (<= 0 aux_mod_main_~index~0_21) (<= (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 1) (< aux_mod_main_~index~0_21 2) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21) 4294967296) 4))) aux_mod_main_~index~0_21) (<= 1 (+ (* 2 aux_div_main_~index~0_21) aux_mod_main_~index~0_21)))) (= main_~index~0 1))} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {761#(and (< |main_#t~mem4| 2) (<= 0 |main_#t~mem4|) (<= (div (+ (- 1) |main_#t~mem4|) (- 2)) (div (+ (* (- 1) |main_#t~mem4|) 1) 2)))} is VALID [2022-04-07 22:21:43,099 INFO L272 TraceCheckUtils]: 23: Hoare triple {761#(and (< |main_#t~mem4| 2) (<= 0 |main_#t~mem4|) (<= (div (+ (- 1) |main_#t~mem4|) (- 2)) (div (+ (* (- 1) |main_#t~mem4|) 1) 2)))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {765#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:21:43,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {769#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:21:43,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {769#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-07 22:21:43,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {676#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-07 22:21:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:43,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:21:43,376 INFO L390 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 23 treesize of output 21 [2022-04-07 22:21:43,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-04-07 22:21:43,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {676#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-07 22:21:43,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {769#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-07 22:21:43,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {769#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:21:43,485 INFO L272 TraceCheckUtils]: 23: Hoare triple {785#(not (= (mod |main_#t~mem4| 4294967296) 0))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {765#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:21:43,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {785#(not (= (mod |main_#t~mem4| 4294967296) 0))} is VALID [2022-04-07 22:21:43,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {789#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} is VALID [2022-04-07 22:21:43,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {789#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} is VALID [2022-04-07 22:21:43,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} is VALID [2022-04-07 22:21:43,489 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {675#true} {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} is VALID [2022-04-07 22:21:43,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {675#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {675#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {675#true} is VALID [2022-04-07 22:21:43,490 INFO L272 TraceCheckUtils]: 14: Hoare triple {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {675#true} is VALID [2022-04-07 22:21:43,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} is VALID [2022-04-07 22:21:43,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} is VALID [2022-04-07 22:21:43,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {824#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {796#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} is VALID [2022-04-07 22:21:43,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {824#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {824#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} is VALID [2022-04-07 22:21:43,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {824#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {824#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} is VALID [2022-04-07 22:21:43,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {834#(forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (+ |main_~#array~0.offset| 4)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {824#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} is VALID [2022-04-07 22:21:43,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#(forall ((|main_~#array~0.offset| Int)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {834#(forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (+ |main_~#array~0.offset| 4)))} is VALID [2022-04-07 22:21:43,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {838#(forall ((|main_~#array~0.offset| Int)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {838#(forall ((|main_~#array~0.offset| Int)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)))} is VALID [2022-04-07 22:21:43,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {838#(forall ((|main_~#array~0.offset| Int)) (= (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (+ |main_~#array~0.offset| 4)))} is VALID [2022-04-07 22:21:43,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {675#true} is VALID [2022-04-07 22:21:43,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-07 22:21:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:43,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798308262] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:21:43,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:21:43,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 19 [2022-04-07 22:21:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321435675] [2022-04-07 22:21:43,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:21:43,498 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-04-07 22:21:43,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:21:43,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:43,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:43,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 22:21:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:21:43,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 22:21:43,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-07 22:21:43,593 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:44,575 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-07 22:21:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 22:21:44,575 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-04-07 22:21:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:21:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-07 22:21:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-07 22:21:44,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2022-04-07 22:21:44,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:44,652 INFO L225 Difference]: With dead ends: 77 [2022-04-07 22:21:44,652 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 22:21:44,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2022-04-07 22:21:44,654 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 22:21:44,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 78 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 268 Invalid, 0 Unknown, 111 Unchecked, 0.4s Time] [2022-04-07 22:21:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 22:21:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-04-07 22:21:44,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:21:44,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 46 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 22:21:44,671 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 46 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 22:21:44,672 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 46 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 22:21:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:44,674 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-07 22:21:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-07 22:21:44,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:44,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:44,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-07 22:21:44,675 INFO L87 Difference]: Start difference. First operand has 46 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-07 22:21:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:44,677 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-07 22:21:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-07 22:21:44,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:44,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:44,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:21:44,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:21:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 22:21:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-07 22:21:44,680 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 27 [2022-04-07 22:21:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:21:44,680 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-07 22:21:44,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-07 22:21:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 22:21:44,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:21:44,681 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:21:44,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 22:21:44,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 22:21:44,903 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:21:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:21:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1290504993, now seen corresponding path program 2 times [2022-04-07 22:21:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:21:44,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362827635] [2022-04-07 22:21:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:21:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:21:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:45,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:21:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:45,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {1171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1158#true} is VALID [2022-04-07 22:21:45,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1158#true} {1158#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-07 22:21:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:45,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {1158#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1158#true} is VALID [2022-04-07 22:21:45,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1158#true} {1159#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1159#false} is VALID [2022-04-07 22:21:45,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {1158#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:21:45,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {1171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1158#true} is VALID [2022-04-07 22:21:45,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1158#true} {1158#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {1158#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {1158#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1163#(= main_~index~0 0)} is VALID [2022-04-07 22:21:45,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {1163#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1163#(= main_~index~0 0)} is VALID [2022-04-07 22:21:45,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {1163#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1164#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:21:45,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {1164#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1164#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:21:45,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {1164#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1165#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 22:21:45,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {1165#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1165#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 22:21:45,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {1165#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1166#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:21:45,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1159#false} is VALID [2022-04-07 22:21:45,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {1159#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1159#false} is VALID [2022-04-07 22:21:45,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {1159#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1159#false} is VALID [2022-04-07 22:21:45,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {1159#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1159#false} is VALID [2022-04-07 22:21:45,070 INFO L272 TraceCheckUtils]: 16: Hoare triple {1159#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1158#true} is VALID [2022-04-07 22:21:45,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {1158#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1158#true} is VALID [2022-04-07 22:21:45,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {1158#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {1158#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,073 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1158#true} {1159#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1159#false} is VALID [2022-04-07 22:21:45,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {1159#false} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1159#false} is VALID [2022-04-07 22:21:45,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {1159#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1159#false} is VALID [2022-04-07 22:21:45,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {1159#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1159#false} is VALID [2022-04-07 22:21:45,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {1159#false} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1159#false} is VALID [2022-04-07 22:21:45,075 INFO L272 TraceCheckUtils]: 25: Hoare triple {1159#false} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1159#false} is VALID [2022-04-07 22:21:45,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {1159#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1159#false} is VALID [2022-04-07 22:21:45,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {1159#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1159#false} is VALID [2022-04-07 22:21:45,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {1159#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1159#false} is VALID [2022-04-07 22:21:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 22:21:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:21:45,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362827635] [2022-04-07 22:21:45,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362827635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:21:45,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324219157] [2022-04-07 22:21:45,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 22:21:45,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:21:45,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:21:45,077 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-04-07 22:21:45,113 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-04-07 22:21:45,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 22:21:45,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:21:45,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 22:21:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:45,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:21:45,181 INFO L390 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 19 treesize of output 15 [2022-04-07 22:21:45,236 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-04-07 22:21:45,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 27 treesize of output 26 [2022-04-07 22:21:45,321 INFO L356 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-04-07 22:21:45,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-04-07 22:21:45,739 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-07 22:21:45,739 INFO L390 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 10 [2022-04-07 22:21:45,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {1158#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1158#true} is VALID [2022-04-07 22:21:45,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1158#true} {1158#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {1158#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:45,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {1158#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1163#(= main_~index~0 0)} is VALID [2022-04-07 22:21:45,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {1163#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1193#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:21:45,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1197#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-07 22:21:45,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {1197#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1201#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} is VALID [2022-04-07 22:21:45,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {1201#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1205#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:21:45,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {1205#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1209#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:21:45,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {1209#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1209#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:21:45,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1209#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:21:45,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1219#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:21:45,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {1219#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1219#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:21:45,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {1219#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1226#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:21:45,800 INFO L272 TraceCheckUtils]: 16: Hoare triple {1226#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1230#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) |v_main_~#array~0.offset_BEFORE_CALL_3|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| 4)) 1)))} is VALID [2022-04-07 22:21:45,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {1230#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) |v_main_~#array~0.offset_BEFORE_CALL_3|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| 4)) 1)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1234#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) |v_main_~#array~0.offset_BEFORE_CALL_3|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| 4)) 1))))} is VALID [2022-04-07 22:21:45,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {1234#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) |v_main_~#array~0.offset_BEFORE_CALL_3|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| 4)) 1))))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1238#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) |v_main_~#array~0.offset_BEFORE_CALL_3|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| 4)) 1))))} is VALID [2022-04-07 22:21:45,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) |v_main_~#array~0.offset_BEFORE_CALL_3|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| 4)) 1))))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1238#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) |v_main_~#array~0.offset_BEFORE_CALL_3|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| 4)) 1))))} is VALID [2022-04-07 22:21:45,803 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1238#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) |v_main_~#array~0.offset_BEFORE_CALL_3|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) (+ |v_main_~#array~0.offset_BEFORE_CALL_3| 4)) 1))))} {1226#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1219#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:21:45,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {1219#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1219#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:21:45,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {1219#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1201#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} is VALID [2022-04-07 22:21:45,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {1201#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1201#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} is VALID [2022-04-07 22:21:45,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {1201#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)) (= main_~index~0 1))} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1257#(= |main_#t~mem4| 1)} is VALID [2022-04-07 22:21:45,807 INFO L272 TraceCheckUtils]: 25: Hoare triple {1257#(= |main_#t~mem4| 1)} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1261#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:21:45,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1265#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:21:45,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {1265#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1159#false} is VALID [2022-04-07 22:21:45,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {1159#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1159#false} is VALID [2022-04-07 22:21:45,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:45,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:21:47,946 INFO L390 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 97 treesize of output 93 [2022-04-07 22:21:47,989 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-07 22:21:47,990 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 2497 treesize of output 2473 [2022-04-07 22:21:48,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {1159#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1159#false} is VALID [2022-04-07 22:21:48,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {1265#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1159#false} is VALID [2022-04-07 22:21:48,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1265#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:21:48,345 INFO L272 TraceCheckUtils]: 25: Hoare triple {1281#(not (= (mod |main_#t~mem4| 4294967296) 0))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1261#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:21:48,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {1285#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1281#(not (= (mod |main_#t~mem4| 4294967296) 0))} is VALID [2022-04-07 22:21:48,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {1285#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1285#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} is VALID [2022-04-07 22:21:48,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {1292#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1285#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} is VALID [2022-04-07 22:21:48,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {1292#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1292#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} is VALID [2022-04-07 22:21:48,353 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1303#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (aux_mod_v_main_~index~0_BEFORE_CALL_4_43 Int) (aux_div_v_main_~index~0_BEFORE_CALL_4_43 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 0) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod (+ aux_mod_v_main_~index~0_BEFORE_CALL_4_43 (* aux_div_v_main_~index~0_BEFORE_CALL_4_43 2)) 4294967296)))) 4294967296) 0)) (>= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 2) (> 0 aux_mod_v_main_~index~0_BEFORE_CALL_4_43))))} {1299#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (not (= (mod |main_#t~mem3| 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1292#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} is VALID [2022-04-07 22:21:48,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {1303#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (aux_mod_v_main_~index~0_BEFORE_CALL_4_43 Int) (aux_div_v_main_~index~0_BEFORE_CALL_4_43 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 0) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod (+ aux_mod_v_main_~index~0_BEFORE_CALL_4_43 (* aux_div_v_main_~index~0_BEFORE_CALL_4_43 2)) 4294967296)))) 4294967296) 0)) (>= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 2) (> 0 aux_mod_v_main_~index~0_BEFORE_CALL_4_43))))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1303#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (aux_mod_v_main_~index~0_BEFORE_CALL_4_43 Int) (aux_div_v_main_~index~0_BEFORE_CALL_4_43 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 0) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod (+ aux_mod_v_main_~index~0_BEFORE_CALL_4_43 (* aux_div_v_main_~index~0_BEFORE_CALL_4_43 2)) 4294967296)))) 4294967296) 0)) (>= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 2) (> 0 aux_mod_v_main_~index~0_BEFORE_CALL_4_43))))} is VALID [2022-04-07 22:21:48,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {1310#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (aux_mod_v_main_~index~0_BEFORE_CALL_4_43 Int) (aux_div_v_main_~index~0_BEFORE_CALL_4_43 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 0) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod (+ aux_mod_v_main_~index~0_BEFORE_CALL_4_43 (* aux_div_v_main_~index~0_BEFORE_CALL_4_43 2)) 4294967296)))) 4294967296) 0)) (>= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 2) (> 0 aux_mod_v_main_~index~0_BEFORE_CALL_4_43))))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1303#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (aux_mod_v_main_~index~0_BEFORE_CALL_4_43 Int) (aux_div_v_main_~index~0_BEFORE_CALL_4_43 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 0) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod (+ aux_mod_v_main_~index~0_BEFORE_CALL_4_43 (* aux_div_v_main_~index~0_BEFORE_CALL_4_43 2)) 4294967296)))) 4294967296) 0)) (>= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 2) (> 0 aux_mod_v_main_~index~0_BEFORE_CALL_4_43))))} is VALID [2022-04-07 22:21:48,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {1158#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1310#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0) (forall ((|v_main_~#array~0.offset_BEFORE_CALL_4| Int) (aux_mod_v_main_~index~0_BEFORE_CALL_4_43 Int) (aux_div_v_main_~index~0_BEFORE_CALL_4_43 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 0) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) (+ |v_main_~#array~0.offset_BEFORE_CALL_4| (* 4 (mod (+ aux_mod_v_main_~index~0_BEFORE_CALL_4_43 (* aux_div_v_main_~index~0_BEFORE_CALL_4_43 2)) 4294967296)))) 4294967296) 0)) (>= aux_mod_v_main_~index~0_BEFORE_CALL_4_43 2) (> 0 aux_mod_v_main_~index~0_BEFORE_CALL_4_43))))} is VALID [2022-04-07 22:21:48,355 INFO L272 TraceCheckUtils]: 16: Hoare triple {1299#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (not (= (mod |main_#t~mem3| 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1158#true} is VALID [2022-04-07 22:21:48,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {1317#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1299#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (not (= (mod |main_#t~mem3| 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} is VALID [2022-04-07 22:21:48,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {1321#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod main_~index~0 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1317#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0))} is VALID [2022-04-07 22:21:48,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {1325#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1321#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 22:21:48,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {1325#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1325#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)))} is VALID [2022-04-07 22:21:48,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {1325#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1325#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)))} is VALID [2022-04-07 22:21:48,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {1335#(forall ((v_ArrVal_50 Int)) (or (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) |main_~#array~0.offset|) 4294967296) 0))))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1325#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)))} is VALID [2022-04-07 22:21:48,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {1339#(forall ((v_ArrVal_50 Int)) (or (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) |main_~#array~0.offset|) 4294967296) 0)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) (+ |main_~#array~0.offset| 4)) 4294967296) 0))))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1335#(forall ((v_ArrVal_50 Int)) (or (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) |main_~#array~0.offset|) 4294967296) 0))))} is VALID [2022-04-07 22:21:48,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#(forall ((v_ArrVal_50 Int)) (or (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) |main_~#array~0.offset|) 4294967296) 0))))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1339#(forall ((v_ArrVal_50 Int)) (or (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) |main_~#array~0.offset|) 4294967296) 0)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) (+ |main_~#array~0.offset| 4)) 4294967296) 0))))} is VALID [2022-04-07 22:21:48,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {1347#(forall ((v_ArrVal_50 Int)) (or (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_50) |main_~#array~0.offset|) 4294967296) 0)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_50) (+ |main_~#array~0.offset| 4)) 4294967296) 0))))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1343#(forall ((v_ArrVal_50 Int)) (or (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) (mod main_~index~0 2)) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_50) |main_~#array~0.offset|) 4294967296) 0))))} is VALID [2022-04-07 22:21:48,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {1351#(or (= (* (mod (+ main_~index~0 1) 4294967296) 4) 4) (= (* (mod main_~index~0 4294967296) 4) 4))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1347#(forall ((v_ArrVal_50 Int)) (or (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_50) |main_~#array~0.offset|) 4294967296) 0)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) (mod (+ main_~index~0 1) 2)) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_50) (+ |main_~#array~0.offset| 4)) 4294967296) 0))))} is VALID [2022-04-07 22:21:48,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {1158#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1351#(or (= (* (mod (+ main_~index~0 1) 4294967296) 4) 4) (= (* (mod main_~index~0 4294967296) 4) 4))} is VALID [2022-04-07 22:21:48,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {1158#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:48,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1158#true} {1158#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:48,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:48,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1158#true} is VALID [2022-04-07 22:21:48,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {1158#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#true} is VALID [2022-04-07 22:21:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:48,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324219157] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:21:48,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:21:48,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 18] total 34 [2022-04-07 22:21:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680973171] [2022-04-07 22:21:48,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:21:48,390 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2022-04-07 22:21:48,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:21:48,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:52,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 71 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:52,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-07 22:21:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:21:52,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-07 22:21:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 22:21:52,495 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 34 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:53,923 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-04-07 22:21:53,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-07 22:21:53,923 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2022-04-07 22:21:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:21:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2022-04-07 22:21:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2022-04-07 22:21:53,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 75 transitions. [2022-04-07 22:21:58,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 73 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 22:21:58,054 INFO L225 Difference]: With dead ends: 98 [2022-04-07 22:21:58,055 INFO L226 Difference]: Without dead ends: 65 [2022-04-07 22:21:58,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=347, Invalid=2203, Unknown=0, NotChecked=0, Total=2550 [2022-04-07 22:21:58,056 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 22:21:58,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 155 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 193 Invalid, 0 Unknown, 153 Unchecked, 0.3s Time] [2022-04-07 22:21:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-07 22:21:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-04-07 22:21:58,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:21:58,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 63 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 22:21:58,086 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 63 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 22:21:58,086 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 63 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 22:21:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:58,089 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-07 22:21:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-07 22:21:58,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:58,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:58,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 65 states. [2022-04-07 22:21:58,090 INFO L87 Difference]: Start difference. First operand has 63 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 65 states. [2022-04-07 22:21:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:21:58,092 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-07 22:21:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-07 22:21:58,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:21:58,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:21:58,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:21:58,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:21:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 22:21:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2022-04-07 22:21:58,096 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 29 [2022-04-07 22:21:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:21:58,096 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2022-04-07 22:21:58,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 2.0) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:21:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-07 22:21:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 22:21:58,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:21:58,097 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:21:58,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 22:21:58,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:21:58,312 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:21:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:21:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2000451355, now seen corresponding path program 3 times [2022-04-07 22:21:58,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:21:58,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997540192] [2022-04-07 22:21:58,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:21:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:21:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:21:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:58,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {1782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1766#true} is VALID [2022-04-07 22:21:58,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1766#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:58,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1766#true} {1766#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 22:21:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:58,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {1766#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1766#true} is VALID [2022-04-07 22:21:58,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {1766#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:58,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {1766#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:58,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1766#true} {1767#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1767#false} is VALID [2022-04-07 22:21:58,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {1766#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:21:58,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {1782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1766#true} is VALID [2022-04-07 22:21:58,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {1766#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:58,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1766#true} {1766#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:58,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {1766#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:58,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {1766#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1771#(= main_~index~0 0)} is VALID [2022-04-07 22:21:58,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {1771#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1771#(= main_~index~0 0)} is VALID [2022-04-07 22:21:58,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {1771#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1772#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:21:58,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1772#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:21:58,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {1772#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1773#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 22:21:58,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {1773#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1773#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 22:21:58,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {1773#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1774#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 22:21:58,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {1774#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1774#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 22:21:58,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {1774#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1775#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 22:21:58,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#(and (<= 4 main_~index~0) (<= main_~index~0 4))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1775#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 22:21:58,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#(and (<= 4 main_~index~0) (<= main_~index~0 4))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1776#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-07 22:21:58,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {1776#(and (<= 5 main_~index~0) (<= main_~index~0 5))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1776#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-07 22:21:58,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#(and (<= 5 main_~index~0) (<= main_~index~0 5))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1777#(and (<= main_~index~0 6) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:21:58,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {1777#(and (<= main_~index~0 6) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1767#false} is VALID [2022-04-07 22:21:58,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {1767#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1767#false} is VALID [2022-04-07 22:21:58,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {1767#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1767#false} is VALID [2022-04-07 22:21:58,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {1767#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1767#false} is VALID [2022-04-07 22:21:58,470 INFO L272 TraceCheckUtils]: 22: Hoare triple {1767#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1766#true} is VALID [2022-04-07 22:21:58,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {1766#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1766#true} is VALID [2022-04-07 22:21:58,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {1766#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:58,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {1766#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:58,470 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1766#true} {1767#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1767#false} is VALID [2022-04-07 22:21:58,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {1767#false} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1767#false} is VALID [2022-04-07 22:21:58,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {1767#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1767#false} is VALID [2022-04-07 22:21:58,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {1767#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1767#false} is VALID [2022-04-07 22:21:58,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {1767#false} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1767#false} is VALID [2022-04-07 22:21:58,471 INFO L272 TraceCheckUtils]: 31: Hoare triple {1767#false} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1767#false} is VALID [2022-04-07 22:21:58,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {1767#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1767#false} is VALID [2022-04-07 22:21:58,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {1767#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1767#false} is VALID [2022-04-07 22:21:58,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {1767#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1767#false} is VALID [2022-04-07 22:21:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 22:21:58,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:21:58,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997540192] [2022-04-07 22:21:58,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997540192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:21:58,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559142615] [2022-04-07 22:21:58,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 22:21:58,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:21:58,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:21:58,475 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-04-07 22:21:58,480 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-04-07 22:21:58,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-07 22:21:58,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:21:58,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-07 22:21:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:21:58,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:21:58,667 INFO L390 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 19 treesize of output 15 [2022-04-07 22:21:58,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-07 22:21:58,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-04-07 22:21:58,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-07 22:21:58,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-07 22:21:58,836 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-04-07 22:21:58,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 27 treesize of output 34 [2022-04-07 22:21:58,914 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-04-07 22:21:58,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 37 treesize of output 44 [2022-04-07 22:21:59,354 INFO L390 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-04-07 22:21:59,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {1766#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:59,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {1766#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1766#true} is VALID [2022-04-07 22:21:59,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {1766#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:59,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1766#true} {1766#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:59,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {1766#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:21:59,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {1766#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1801#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} is VALID [2022-04-07 22:21:59,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {1801#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1801#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} is VALID [2022-04-07 22:21:59,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {1801#(and (= |main_~#array~0.offset| 0) (= main_~index~0 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1808#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 22:21:59,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {1808#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1812#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:21:59,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {1812#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1816#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} is VALID [2022-04-07 22:21:59,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {1816#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1816#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} is VALID [2022-04-07 22:21:59,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {1816#(and (= 2 main_~index~0) (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1823#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)))} is VALID [2022-04-07 22:21:59,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {1823#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1827#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} is VALID [2022-04-07 22:21:59,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1827#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} is VALID [2022-04-07 22:21:59,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1834#(and (= |main_~#array~0.offset| 0) (or (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (* (mod main_~index~0 4294967296) 4) 4)))} is VALID [2022-04-07 22:21:59,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {1834#(and (= |main_~#array~0.offset| 0) (or (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (* (mod main_~index~0 4294967296) 4) 4)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1838#(and (or (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 4)) (= |main_~#array~0.offset| 0))} is VALID [2022-04-07 22:21:59,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {1838#(and (or (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 4)) (= |main_~#array~0.offset| 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1842#(and (= |main_~#array~0.offset| 0) (or (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 4) (= (* (mod main_~index~0 4294967296) 4) 4)))} is VALID [2022-04-07 22:21:59,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {1842#(and (= |main_~#array~0.offset| 0) (or (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 4) (= (* (mod main_~index~0 4294967296) 4) 4)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1846#(and (= |main_~#array~0.offset| 0) (or (= (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 4)))} is VALID [2022-04-07 22:21:59,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#(and (= |main_~#array~0.offset| 0) (or (= (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 4)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1827#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} is VALID [2022-04-07 22:21:59,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {1827#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} is VALID [2022-04-07 22:21:59,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} is VALID [2022-04-07 22:21:59,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} is VALID [2022-04-07 22:21:59,437 INFO L272 TraceCheckUtils]: 22: Hoare triple {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1863#(exists ((|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) 4) 1))} is VALID [2022-04-07 22:21:59,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {1863#(exists ((|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) 4) 1))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1863#(exists ((|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) 4) 1))} is VALID [2022-04-07 22:21:59,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {1863#(exists ((|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) 4) 1))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1863#(exists ((|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) 4) 1))} is VALID [2022-04-07 22:21:59,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {1863#(exists ((|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) 4) 1))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1863#(exists ((|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) 4) 1))} is VALID [2022-04-07 22:21:59,439 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1863#(exists ((|v_main_~#array~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_5|) 4) 1))} {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} is VALID [2022-04-07 22:21:59,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} is VALID [2022-04-07 22:21:59,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {1853#(and (= |main_~#array~0.offset| 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1812#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:21:59,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {1812#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1812#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:21:59,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {1812#(and (= |main_~#array~0.offset| 0) (= (+ (- 1) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1888#(= |main_#t~mem4| 1)} is VALID [2022-04-07 22:21:59,442 INFO L272 TraceCheckUtils]: 31: Hoare triple {1888#(= |main_#t~mem4| 1)} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1892#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:21:59,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {1892#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1896#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:21:59,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {1896#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1767#false} is VALID [2022-04-07 22:21:59,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {1767#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1767#false} is VALID [2022-04-07 22:21:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:21:59,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:22:08,332 INFO L390 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 45 treesize of output 43 [2022-04-07 22:22:08,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 538 treesize of output 530 [2022-04-07 22:22:08,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {1767#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1767#false} is VALID [2022-04-07 22:22:08,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {1896#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1767#false} is VALID [2022-04-07 22:22:08,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {1892#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1896#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:22:08,510 INFO L272 TraceCheckUtils]: 31: Hoare triple {1912#(not (= (mod |main_#t~mem4| 4294967296) 0))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {1892#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:22:08,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {1916#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {1912#(not (= (mod |main_#t~mem4| 4294967296) 0))} is VALID [2022-04-07 22:22:08,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {1920#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1916#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)))} is VALID [2022-04-07 22:22:08,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {1920#(or (= (mod main_~index~0 2) 0) (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-07 22:22:08,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 22:22:08,514 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1766#true} {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 22:22:08,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {1766#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:22:08,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {1766#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:22:08,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {1766#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1766#true} is VALID [2022-04-07 22:22:08,515 INFO L272 TraceCheckUtils]: 22: Hoare triple {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {1766#true} is VALID [2022-04-07 22:22:08,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 22:22:08,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 22:22:08,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {1952#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {1924#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) 0)) (= (mod (+ main_~index~0 1) 2) 0) (not (< (mod (+ main_~index~0 1) 4294967296) 1000)))} is VALID [2022-04-07 22:22:08,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {1956#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (< (mod main_~index~0 4294967296) 1000))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {1952#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} is VALID [2022-04-07 22:22:08,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {1960#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (< (mod (+ main_~index~0 1) 4294967296) 1000))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1956#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (< (mod main_~index~0 4294967296) 1000))} is VALID [2022-04-07 22:22:08,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {1960#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (< (mod (+ main_~index~0 1) 4294967296) 1000))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1960#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (< (mod (+ main_~index~0 1) 4294967296) 1000))} is VALID [2022-04-07 22:22:08,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (< (mod (+ 2 main_~index~0) 4294967296) 1000))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1960#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (< (mod (+ main_~index~0 1) 4294967296) 1000))} is VALID [2022-04-07 22:22:08,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1967#(or (not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0)) (< (mod (+ 2 main_~index~0) 4294967296) 1000))} is VALID [2022-04-07 22:22:08,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {1952#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1952#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} is VALID [2022-04-07 22:22:08,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {1977#(forall ((v_ArrVal_84 Int)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_84) (+ |main_~#array~0.offset| 4)) 4294967296) 0)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1952#(not (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 4294967296) 0))} is VALID [2022-04-07 22:22:08,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {1981#(forall ((v_ArrVal_84 Int)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_84) (+ |main_~#array~0.offset| 4)) 4294967296) 0)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1977#(forall ((v_ArrVal_84 Int)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_84) (+ |main_~#array~0.offset| 4)) 4294967296) 0)))} is VALID [2022-04-07 22:22:08,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {1985#(forall ((v_ArrVal_82 Int) (v_ArrVal_84 Int)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_82) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_84) (+ |main_~#array~0.offset| 4)) 4294967296) 0)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1981#(forall ((v_ArrVal_84 Int)) (not (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_84) (+ |main_~#array~0.offset| 4)) 4294967296) 0)))} is VALID [2022-04-07 22:22:08,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {1989#(forall ((v_ArrVal_82 Int) (v_ArrVal_84 Int)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_82) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_84) (+ |main_~#array~0.offset| 4)) 4294967296) 0)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1985#(forall ((v_ArrVal_82 Int) (v_ArrVal_84 Int)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_82) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_84) (+ |main_~#array~0.offset| 4)) 4294967296) 0)))} is VALID [2022-04-07 22:22:08,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {1993#(= (* (mod main_~index~0 4294967296) 4) 4)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1989#(forall ((v_ArrVal_82 Int) (v_ArrVal_84 Int)) (not (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_82) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_84) (+ |main_~#array~0.offset| 4)) 4294967296) 0)))} is VALID [2022-04-07 22:22:08,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {1997#(= (* (mod (+ main_~index~0 1) 4294967296) 4) 4)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {1993#(= (* (mod main_~index~0 4294967296) 4) 4)} is VALID [2022-04-07 22:22:08,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {1997#(= (* (mod (+ main_~index~0 1) 4294967296) 4) 4)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {1997#(= (* (mod (+ main_~index~0 1) 4294967296) 4) 4)} is VALID [2022-04-07 22:22:08,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {1766#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {1997#(= (* (mod (+ main_~index~0 1) 4294967296) 4) 4)} is VALID [2022-04-07 22:22:08,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {1766#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:22:08,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1766#true} {1766#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:22:08,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {1766#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:22:08,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {1766#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1766#true} is VALID [2022-04-07 22:22:08,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {1766#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1766#true} is VALID [2022-04-07 22:22:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:22:08,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559142615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:22:08,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:22:08,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 18] total 39 [2022-04-07 22:22:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869052054] [2022-04-07 22:22:08,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:22:08,553 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2022-04-07 22:22:08,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:22:08,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:22:08,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:22:08,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-07 22:22:08,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:22:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-07 22:22:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1223, Unknown=0, NotChecked=0, Total=1482 [2022-04-07 22:22:08,660 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 39 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:22:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:22:13,121 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2022-04-07 22:22:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-07 22:22:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2022-04-07 22:22:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:22:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:22:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 160 transitions. [2022-04-07 22:22:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:22:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 160 transitions. [2022-04-07 22:22:13,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 160 transitions. [2022-04-07 22:22:13,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:22:13,321 INFO L225 Difference]: With dead ends: 165 [2022-04-07 22:22:13,321 INFO L226 Difference]: Without dead ends: 121 [2022-04-07 22:22:13,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 42 SyntacticMatches, 17 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1129, Invalid=5351, Unknown=0, NotChecked=0, Total=6480 [2022-04-07 22:22:13,324 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 303 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-07 22:22:13,324 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 106 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 824 Invalid, 0 Unknown, 361 Unchecked, 1.3s Time] [2022-04-07 22:22:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-07 22:22:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2022-04-07 22:22:13,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:22:13,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 76 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 22:22:13,365 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 76 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 22:22:13,365 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 76 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 22:22:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:22:13,369 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2022-04-07 22:22:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2022-04-07 22:22:13,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:22:13,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:22:13,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 121 states. [2022-04-07 22:22:13,371 INFO L87 Difference]: Start difference. First operand has 76 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 121 states. [2022-04-07 22:22:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:22:13,374 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2022-04-07 22:22:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2022-04-07 22:22:13,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:22:13,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:22:13,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:22:13,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:22:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 22:22:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-04-07 22:22:13,377 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 35 [2022-04-07 22:22:13,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:22:13,378 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-04-07 22:22:13,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:22:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-04-07 22:22:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-07 22:22:13,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:22:13,379 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:22:13,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 22:22:13,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:22:13,595 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:22:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:22:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash -851369580, now seen corresponding path program 1 times [2022-04-07 22:22:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:22:13,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802637619] [2022-04-07 22:22:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:22:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:22:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:13,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:22:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:13,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {2719#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2698#true} is VALID [2022-04-07 22:22:13,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {2698#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2698#true} {2698#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-07 22:22:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:13,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {2698#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2698#true} is VALID [2022-04-07 22:22:13,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {2698#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {2698#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2698#true} {2699#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2699#false} is VALID [2022-04-07 22:22:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-07 22:22:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:13,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {2698#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2698#true} is VALID [2022-04-07 22:22:13,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {2698#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {2698#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2698#true} {2699#false} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2699#false} is VALID [2022-04-07 22:22:13,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {2698#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2719#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:22:13,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {2719#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2698#true} is VALID [2022-04-07 22:22:13,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {2698#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2698#true} {2698#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {2698#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {2698#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {2703#(= main_~index~0 0)} is VALID [2022-04-07 22:22:13,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {2703#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2703#(= main_~index~0 0)} is VALID [2022-04-07 22:22:13,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {2703#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2704#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:22:13,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {2704#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2704#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:22:13,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {2704#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2705#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 22:22:13,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {2705#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2705#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 22:22:13,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {2705#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2706#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 22:22:13,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {2706#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2706#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 22:22:13,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {2706#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2707#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 22:22:13,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {2707#(and (<= 4 main_~index~0) (<= main_~index~0 4))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2707#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 22:22:13,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {2707#(and (<= 4 main_~index~0) (<= main_~index~0 4))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2708#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-07 22:22:13,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {2708#(and (<= 5 main_~index~0) (<= main_~index~0 5))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2708#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-07 22:22:13,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {2708#(and (<= 5 main_~index~0) (<= main_~index~0 5))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2709#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-07 22:22:13,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {2709#(and (<= 6 main_~index~0) (<= main_~index~0 6))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2709#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-07 22:22:13,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {2709#(and (<= 6 main_~index~0) (<= main_~index~0 6))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2710#(and (<= main_~index~0 7) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:22:13,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {2710#(and (<= main_~index~0 7) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 22:22:13,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {2699#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {2699#false} is VALID [2022-04-07 22:22:13,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {2699#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 22:22:13,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {2699#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {2699#false} is VALID [2022-04-07 22:22:13,819 INFO L272 TraceCheckUtils]: 24: Hoare triple {2699#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2698#true} is VALID [2022-04-07 22:22:13,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {2698#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2698#true} is VALID [2022-04-07 22:22:13,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {2698#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {2698#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,820 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2698#true} {2699#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2699#false} is VALID [2022-04-07 22:22:13,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {2699#false} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {2699#false} is VALID [2022-04-07 22:22:13,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {2699#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {2699#false} is VALID [2022-04-07 22:22:13,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {2699#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 22:22:13,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {2699#false} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {2699#false} is VALID [2022-04-07 22:22:13,820 INFO L272 TraceCheckUtils]: 33: Hoare triple {2699#false} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2698#true} is VALID [2022-04-07 22:22:13,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {2698#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2698#true} is VALID [2022-04-07 22:22:13,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {2698#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {2698#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:13,820 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2698#true} {2699#false} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2699#false} is VALID [2022-04-07 22:22:13,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {2699#false} [92] L40-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem4=|v_main_#t~mem4_3|} AuxVars[] AssignedVars[main_#t~mem4] {2699#false} is VALID [2022-04-07 22:22:13,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {2699#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {2699#false} is VALID [2022-04-07 22:22:13,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {2699#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 22:22:13,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {2699#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {2699#false} is VALID [2022-04-07 22:22:13,821 INFO L272 TraceCheckUtils]: 42: Hoare triple {2699#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2699#false} is VALID [2022-04-07 22:22:13,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {2699#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2699#false} is VALID [2022-04-07 22:22:13,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {2699#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 22:22:13,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {2699#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 22:22:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 22:22:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:22:13,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802637619] [2022-04-07 22:22:13,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802637619] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:22:13,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272763507] [2022-04-07 22:22:13,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:22:13,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:22:13,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:22:13,823 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-04-07 22:22:13,835 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-04-07 22:22:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:13,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-07 22:22:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:13,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:22:13,972 INFO L390 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 19 treesize of output 15 [2022-04-07 22:22:14,086 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-07 22:22:14,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 37 treesize of output 36 [2022-04-07 22:22:14,159 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-07 22:22:14,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 35 treesize of output 34 [2022-04-07 22:22:14,225 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-07 22:22:14,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 37 treesize of output 36 [2022-04-07 22:22:15,384 INFO L356 Elim1Store]: treesize reduction 70, result has 20.5 percent of original size [2022-04-07 22:22:15,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 40 treesize of output 39 [2022-04-07 22:22:27,732 INFO L356 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-04-07 22:22:27,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 15 [2022-04-07 22:22:28,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {2698#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:28,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2698#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2698#true} is VALID [2022-04-07 22:22:28,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {2698#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:28,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2698#true} {2698#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:28,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {2698#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2698#true} is VALID [2022-04-07 22:22:28,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {2698#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {2703#(= main_~index~0 0)} is VALID [2022-04-07 22:22:28,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {2703#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2703#(= main_~index~0 0)} is VALID [2022-04-07 22:22:28,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {2703#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2704#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:22:28,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {2704#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2704#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:22:28,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {2704#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2705#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 22:22:28,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {2705#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2753#(and (<= main_~index~0 2) (<= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:22:28,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {2753#(and (<= main_~index~0 2) (<= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2757#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 22:22:28,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {2757#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (<= 3 main_~index~0) (<= main_~index~0 3))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2757#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 22:22:28,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {2757#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (<= 3 main_~index~0) (<= main_~index~0 3))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2764#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 22:22:28,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {2764#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (<= 4 main_~index~0) (<= main_~index~0 4))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2764#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 22:22:28,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {2764#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ 4294967294 main_~index~0) 4294967296)) |main_~#array~0.offset|)) (mod main_~index~0 2)) (<= 4 main_~index~0) (<= main_~index~0 4))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2771#(and (<= 5 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 4294967293) 4294967296) 4) |main_~#array~0.offset|))) (<= main_~index~0 5))} is VALID [2022-04-07 22:22:28,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {2771#(and (<= 5 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 4294967293) 4294967296) 4) |main_~#array~0.offset|))) (<= main_~index~0 5))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2771#(and (<= 5 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 4294967293) 4294967296) 4) |main_~#array~0.offset|))) (<= main_~index~0 5))} is VALID [2022-04-07 22:22:28,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {2771#(and (<= 5 main_~index~0) (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 4294967293) 4294967296) 4) |main_~#array~0.offset|))) (<= main_~index~0 5))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2778#(and (<= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 4294967292 main_~index~0) 4294967296) 4))) (mod main_~index~0 2)) (<= main_~index~0 6))} is VALID [2022-04-07 22:22:28,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {2778#(and (<= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod (+ 4294967292 main_~index~0) 4294967296) 4))) (mod main_~index~0 2)) (<= main_~index~0 6))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {2782#(exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26))))} is VALID [2022-04-07 22:22:28,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#(exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26))))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {2782#(exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26))))} is VALID [2022-04-07 22:22:28,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#(exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26))))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {2782#(exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26))))} is VALID [2022-04-07 22:22:28,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#(exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26))))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {2792#(and (= main_~index~0 0) (exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)))))} is VALID [2022-04-07 22:22:28,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {2792#(and (= main_~index~0 0) (exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)))))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2792#(and (= main_~index~0 0) (exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)))))} is VALID [2022-04-07 22:22:28,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {2792#(and (= main_~index~0 0) (exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)))))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {2799#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= main_~index~0 0) (exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)))))} is VALID [2022-04-07 22:22:28,406 INFO L272 TraceCheckUtils]: 24: Hoare triple {2799#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= main_~index~0 0) (exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)))))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2803#(exists ((aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4))) v_arrayElimCell_26)))} is VALID [2022-04-07 22:22:28,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {2803#(exists ((aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4))) v_arrayElimCell_26)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2807#(and (exists ((aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4))) v_arrayElimCell_26))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2022-04-07 22:22:28,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {2807#(and (exists ((aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4))) v_arrayElimCell_26))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2811#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4))) v_arrayElimCell_26))))} is VALID [2022-04-07 22:22:28,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {2811#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4))) v_arrayElimCell_26))))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2811#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4))) v_arrayElimCell_26))))} is VALID [2022-04-07 22:22:28,430 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2811#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((aux_div_main_~index~0_21 Int) (|v_main_~#array~0.offset_BEFORE_CALL_7| Int) (|v_main_~#array~0.base_BEFORE_CALL_7| Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_7|) (+ |v_main_~#array~0.offset_BEFORE_CALL_7| (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4))) v_arrayElimCell_26))))} {2799#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= main_~index~0 0) (exists ((aux_div_main_~index~0_21 Int) (v_arrayElimCell_26 Int)) (and (<= 0 v_arrayElimCell_26) (<= (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 6) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_26) (< v_arrayElimCell_26 2) (<= 6 (+ (* 2 aux_div_main_~index~0_21) v_arrayElimCell_26)))))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2818#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 0))} is VALID [2022-04-07 22:22:28,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {2818#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {2818#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 0))} is VALID [2022-04-07 22:22:28,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {2818#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} is VALID [2022-04-07 22:22:28,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} is VALID [2022-04-07 22:22:28,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} is VALID [2022-04-07 22:22:28,442 INFO L272 TraceCheckUtils]: 33: Hoare triple {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2835#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) |v_main_~#array~0.offset_BEFORE_CALL_8|) 4294967296) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4))) v_arrayElimCell_27)))} is VALID [2022-04-07 22:22:28,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {2835#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) |v_main_~#array~0.offset_BEFORE_CALL_8|) 4294967296) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4))) v_arrayElimCell_27)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2835#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) |v_main_~#array~0.offset_BEFORE_CALL_8|) 4294967296) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4))) v_arrayElimCell_27)))} is VALID [2022-04-07 22:22:28,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {2835#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) |v_main_~#array~0.offset_BEFORE_CALL_8|) 4294967296) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4))) v_arrayElimCell_27)))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2835#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) |v_main_~#array~0.offset_BEFORE_CALL_8|) 4294967296) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4))) v_arrayElimCell_27)))} is VALID [2022-04-07 22:22:28,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {2835#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) |v_main_~#array~0.offset_BEFORE_CALL_8|) 4294967296) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4))) v_arrayElimCell_27)))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2835#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) |v_main_~#array~0.offset_BEFORE_CALL_8|) 4294967296) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4))) v_arrayElimCell_27)))} is VALID [2022-04-07 22:22:28,497 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2835#(exists ((|v_main_~#array~0.offset_BEFORE_CALL_8| Int) (|v_main_~#array~0.base_BEFORE_CALL_8| Int) (v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) |v_main_~#array~0.offset_BEFORE_CALL_8|) 4294967296) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_8|) (+ |v_main_~#array~0.offset_BEFORE_CALL_8| (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4))) v_arrayElimCell_27)))} {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} is VALID [2022-04-07 22:22:28,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} [92] L40-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem4=|v_main_#t~mem4_3|} AuxVars[] AssignedVars[main_#t~mem4] {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} is VALID [2022-04-07 22:22:28,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {2825#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= main_~index~0 1))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {2854#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= (+ (- 1) main_~index~0) 1))} is VALID [2022-04-07 22:22:28,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {2854#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= (+ (- 1) main_~index~0) 1))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {2854#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= (+ (- 1) main_~index~0) 1))} is VALID [2022-04-07 22:22:28,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {2854#(and (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (exists ((v_arrayElimCell_27 Int) (v_aux_div_main_~index~0_21_1 Int)) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967292 (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 4294967296) 4) |main_~#array~0.offset|)) v_arrayElimCell_27) (<= (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27) 6) (<= 6 (+ (* v_aux_div_main_~index~0_21_1 2) v_arrayElimCell_27)) (< v_arrayElimCell_27 2) (<= 0 v_arrayElimCell_27))) (= (+ (- 1) main_~index~0) 1))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {2861#(and (< |main_#t~mem3| 2) (<= 0 |main_#t~mem3|) (<= (div (+ (- 6) |main_#t~mem3|) (- 2)) (div (+ (* (- 1) |main_#t~mem3|) 6) 2)))} is VALID [2022-04-07 22:22:28,505 INFO L272 TraceCheckUtils]: 42: Hoare triple {2861#(and (< |main_#t~mem3| 2) (<= 0 |main_#t~mem3|) (<= (div (+ (- 6) |main_#t~mem3|) (- 2)) (div (+ (* (- 1) |main_#t~mem3|) 6) 2)))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {2865#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:22:28,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {2865#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2869#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:22:28,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {2869#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 22:22:28,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {2699#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2699#false} is VALID [2022-04-07 22:22:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 64 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:22:28,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:22:32,845 INFO L390 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 132 treesize of output 128 [2022-04-07 22:22:32,956 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-07 22:22:32,956 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70064 treesize of output 69920 [2022-04-07 22:22:38,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-04-07 22:22:38,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 22:22:38,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-07 22:22:38,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912181221] [2022-04-07 22:22:38,953 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 22:22:38,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-04-07 22:22:38,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:22:38,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 22:22:38,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:22:38,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 22:22:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:22:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 22:22:38,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1858, Unknown=5, NotChecked=0, Total=2162 [2022-04-07 22:22:38,982 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 22:22:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:22:39,885 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2022-04-07 22:22:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 22:22:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-04-07 22:22:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:22:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 22:22:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2022-04-07 22:22:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 22:22:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2022-04-07 22:22:39,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 111 transitions. [2022-04-07 22:22:39,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:22:39,983 INFO L225 Difference]: With dead ends: 150 [2022-04-07 22:22:39,983 INFO L226 Difference]: Without dead ends: 95 [2022-04-07 22:22:39,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=364, Invalid=2601, Unknown=5, NotChecked=0, Total=2970 [2022-04-07 22:22:39,985 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 22:22:39,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 22:22:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-07 22:22:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-04-07 22:22:40,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:22:40,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 83 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 22:22:40,039 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 83 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 22:22:40,039 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 83 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 22:22:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:22:40,043 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-07 22:22:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-04-07 22:22:40,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:22:40,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:22:40,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-07 22:22:40,045 INFO L87 Difference]: Start difference. First operand has 83 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-07 22:22:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:22:40,048 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-07 22:22:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-04-07 22:22:40,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:22:40,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:22:40,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:22:40,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:22:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 22:22:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2022-04-07 22:22:40,052 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 46 [2022-04-07 22:22:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:22:40,053 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2022-04-07 22:22:40,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 22:22:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2022-04-07 22:22:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-07 22:22:40,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:22:40,054 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:22:40,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 22:22:40,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:22:40,267 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:22:40,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:22:40,268 INFO L85 PathProgramCache]: Analyzing trace with hash 768467414, now seen corresponding path program 2 times [2022-04-07 22:22:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:22:40,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796058929] [2022-04-07 22:22:40,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:22:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:22:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:40,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:22:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:40,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {3555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3533#true} is VALID [2022-04-07 22:22:40,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {3533#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3533#true} {3533#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-07 22:22:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:40,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {3533#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3533#true} is VALID [2022-04-07 22:22:40,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {3533#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {3533#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3533#true} {3534#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {3534#false} is VALID [2022-04-07 22:22:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-07 22:22:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:40,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {3533#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3533#true} is VALID [2022-04-07 22:22:40,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {3533#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {3533#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3533#true} {3534#false} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {3534#false} is VALID [2022-04-07 22:22:40,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {3533#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:22:40,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {3555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3533#true} is VALID [2022-04-07 22:22:40,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {3533#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3533#true} {3533#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {3533#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {3533#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {3538#(= main_~index~0 0)} is VALID [2022-04-07 22:22:40,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {3538#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3538#(= main_~index~0 0)} is VALID [2022-04-07 22:22:40,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {3538#(= main_~index~0 0)} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3539#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:22:40,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {3539#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3539#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-07 22:22:40,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {3539#(and (<= main_~index~0 1) (<= 1 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3540#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 22:22:40,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {3540#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3540#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-07 22:22:40,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {3540#(and (<= main_~index~0 2) (<= 2 main_~index~0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3541#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 22:22:40,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {3541#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3541#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-07 22:22:40,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {3541#(and (<= 3 main_~index~0) (<= main_~index~0 3))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3542#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 22:22:40,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {3542#(and (<= 4 main_~index~0) (<= main_~index~0 4))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3542#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-07 22:22:40,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {3542#(and (<= 4 main_~index~0) (<= main_~index~0 4))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3543#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-07 22:22:40,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {3543#(and (<= 5 main_~index~0) (<= main_~index~0 5))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3543#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-07 22:22:40,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {3543#(and (<= 5 main_~index~0) (<= main_~index~0 5))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3544#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-07 22:22:40,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {3544#(and (<= 6 main_~index~0) (<= main_~index~0 6))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3544#(and (<= 6 main_~index~0) (<= main_~index~0 6))} is VALID [2022-04-07 22:22:40,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {3544#(and (<= 6 main_~index~0) (<= main_~index~0 6))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3545#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-07 22:22:40,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {3545#(and (<= 7 main_~index~0) (<= main_~index~0 7))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3545#(and (<= 7 main_~index~0) (<= main_~index~0 7))} is VALID [2022-04-07 22:22:40,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {3545#(and (<= 7 main_~index~0) (<= main_~index~0 7))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3546#(and (<= main_~index~0 8) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:22:40,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {3546#(and (<= main_~index~0 8) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {3534#false} is VALID [2022-04-07 22:22:40,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {3534#false} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {3534#false} is VALID [2022-04-07 22:22:40,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {3534#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {3534#false} is VALID [2022-04-07 22:22:40,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {3534#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {3534#false} is VALID [2022-04-07 22:22:40,476 INFO L272 TraceCheckUtils]: 26: Hoare triple {3534#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {3533#true} is VALID [2022-04-07 22:22:40,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {3533#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3533#true} is VALID [2022-04-07 22:22:40,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {3533#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {3533#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,476 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3533#true} {3534#false} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {3534#false} is VALID [2022-04-07 22:22:40,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {3534#false} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {3534#false} is VALID [2022-04-07 22:22:40,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {3534#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {3534#false} is VALID [2022-04-07 22:22:40,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {3534#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {3534#false} is VALID [2022-04-07 22:22:40,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {3534#false} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {3534#false} is VALID [2022-04-07 22:22:40,477 INFO L272 TraceCheckUtils]: 35: Hoare triple {3534#false} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {3533#true} is VALID [2022-04-07 22:22:40,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {3533#true} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3533#true} is VALID [2022-04-07 22:22:40,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {3533#true} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {3533#true} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:40,477 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3533#true} {3534#false} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {3534#false} is VALID [2022-04-07 22:22:40,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {3534#false} [92] L40-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem4=|v_main_#t~mem4_3|} AuxVars[] AssignedVars[main_#t~mem4] {3534#false} is VALID [2022-04-07 22:22:40,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {3534#false} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {3534#false} is VALID [2022-04-07 22:22:40,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {3534#false} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {3534#false} is VALID [2022-04-07 22:22:40,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {3534#false} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {3534#false} is VALID [2022-04-07 22:22:40,478 INFO L272 TraceCheckUtils]: 44: Hoare triple {3534#false} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {3534#false} is VALID [2022-04-07 22:22:40,478 INFO L290 TraceCheckUtils]: 45: Hoare triple {3534#false} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3534#false} is VALID [2022-04-07 22:22:40,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {3534#false} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3534#false} is VALID [2022-04-07 22:22:40,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {3534#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3534#false} is VALID [2022-04-07 22:22:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 22:22:40,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:22:40,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796058929] [2022-04-07 22:22:40,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796058929] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:22:40,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936609535] [2022-04-07 22:22:40,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 22:22:40,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:22:40,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:22:40,483 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-04-07 22:22:40,513 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-04-07 22:22:40,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 22:22:40,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:22:40,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-07 22:22:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:22:40,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:22:40,655 INFO L390 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 19 treesize of output 15 [2022-04-07 22:22:40,706 INFO L356 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-04-07 22:22:40,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 39 treesize of output 38 [2022-04-07 22:22:40,778 INFO L356 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2022-04-07 22:22:40,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2022-04-07 22:22:40,887 INFO L356 Elim1Store]: treesize reduction 158, result has 16.8 percent of original size [2022-04-07 22:22:40,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2022-04-07 22:22:40,970 INFO L356 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2022-04-07 22:22:40,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 48 [2022-04-07 22:22:41,051 INFO L356 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2022-04-07 22:22:41,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 48 [2022-04-07 22:22:41,131 INFO L356 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2022-04-07 22:22:41,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 48 [2022-04-07 22:22:41,223 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-04-07 22:22:41,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-04-07 22:22:42,116 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-07 22:22:42,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2022-04-07 22:22:42,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {3533#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:42,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {3533#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= (select |v_#valid_5| 0) 0) (= 31 (select |v_#length_3| 2)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3533#true} is VALID [2022-04-07 22:22:42,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {3533#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:42,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3533#true} {3533#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:42,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {3533#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3533#true} is VALID [2022-04-07 22:22:42,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {3533#true} [74] mainENTRY-->L32-3: Formula: (and (= v_main_~index~0_3 0) (not (= |v_main_~#array~0.base_3| 0)) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_3| 4000)) (= |v_main_~#array~0.offset_3| 0) (= (store |v_#valid_2| |v_main_~#array~0.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_3|) (= (select |v_#valid_2| |v_main_~#array~0.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~index~0=v_main_~index~0_3, main_~#array~0.base=|v_main_~#array~0.base_3|, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[main_~index~0, main_~#array~0.base, #valid, main_~#array~0.offset, #length] {3538#(= main_~index~0 0)} is VALID [2022-04-07 22:22:42,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {3538#(= main_~index~0 0)} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3577#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:22:42,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {3577#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3581#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 22:22:42,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3585#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:22:42,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {3585#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3589#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {3589#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3593#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:22:42,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {3593#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3597#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3597#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {3597#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3604#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {3604#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3604#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {3604#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3611#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {3611#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3611#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {3611#(and (= 5 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3618#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {3618#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3618#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {3618#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= 6 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3625#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 6 (+ (- 1) main_~index~0)))} is VALID [2022-04-07 22:22:42,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {3625#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 6 (+ (- 1) main_~index~0)))} [78] L32-3-->L32-2: Formula: (let ((.cse0 (mod v_main_~index~0_8 4294967296))) (and (= (store |v_#memory_int_4| |v_main_~#array~0.base_6| (store (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* .cse0 4) |v_main_~#array~0.offset_6|) (mod v_main_~index~0_8 2))) |v_#memory_int_3|) (< .cse0 1000))) InVars {#memory_int=|v_#memory_int_4|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} OutVars{#memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~index~0=v_main_~index~0_8, main_~#array~0.base=|v_main_~#array~0.base_6|} AuxVars[] AssignedVars[#memory_int] {3629#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {3629#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [80] L32-2-->L32-3: Formula: (= (+ v_main_~index~0_10 1) v_main_~index~0_9) InVars {main_~index~0=v_main_~index~0_10} OutVars{main_#t~post1=|v_main_#t~post1_1|, main_~index~0=v_main_~index~0_9} AuxVars[] AssignedVars[main_~index~0, main_#t~post1] {3629#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {3629#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [77] L32-3-->L32-4: Formula: (not (< (mod v_main_~index~0_7 4294967296) 1000)) InVars {main_~index~0=v_main_~index~0_7} OutVars{main_~index~0=v_main_~index~0_7} AuxVars[] AssignedVars[] {3629#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-07 22:22:42,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {3629#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} [79] L32-4-->L36-3: Formula: (= v_main_~index~0_11 0) InVars {} OutVars{main_~index~0=v_main_~index~0_11} AuxVars[] AssignedVars[main_~index~0] {3639#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:22:42,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {3639#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {3639#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:22:42,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {3639#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {3646#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:22:42,197 INFO L272 TraceCheckUtils]: 26: Hoare triple {3646#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} is VALID [2022-04-07 22:22:42,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3654#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2022-04-07 22:22:42,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {3654#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3658#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0))) (not (= |__VERIFIER_assert_#in~cond| 0)))} is VALID [2022-04-07 22:22:42,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {3658#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0))) (not (= |__VERIFIER_assert_#in~cond| 0)))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3658#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0))) (not (= |__VERIFIER_assert_#in~cond| 0)))} is VALID [2022-04-07 22:22:42,200 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3658#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0))) (not (= |__VERIFIER_assert_#in~cond| 0)))} {3646#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) |main_#t~mem3|) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [101] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {3639#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:22:42,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {3639#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [90] L38-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem3=|v_main_#t~mem3_3|} AuxVars[] AssignedVars[main_#t~mem3] {3639#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-07 22:22:42,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {3639#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 22:22:42,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 22:22:42,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [86] L37-->L40: Formula: (and (not (= (mod v_main_~index~0_2 2) 0)) (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_2|) (+ (* (mod v_main_~index~0_2 4294967296) 4) |v_main_~#array~0.offset_2|)))) InVars {#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~index~0=v_main_~index~0_2, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem4=|v_main_#t~mem4_1|} AuxVars[] AssignedVars[main_#t~mem4] {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 22:22:42,202 INFO L272 TraceCheckUtils]: 35: Hoare triple {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [89] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} is VALID [2022-04-07 22:22:42,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} is VALID [2022-04-07 22:22:42,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} [95] L21-->L21-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} is VALID [2022-04-07 22:22:42,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} [98] L21-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} is VALID [2022-04-07 22:22:42,205 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3650#(exists ((|v_main_~#array~0.base_BEFORE_CALL_11| Int) (|v_main_~#array~0.offset_BEFORE_CALL_11| Int)) (and (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) |v_main_~#array~0.offset_BEFORE_CALL_11|) 0) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 4 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 1) (= (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_11|) (+ 8 |v_main_~#array~0.offset_BEFORE_CALL_11|)) 0)))} {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [102] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (not (= (mod |v_main_#t~mem4_4| 4294967296) 0)) 1 0)) InVars {main_#t~mem4=|v_main_#t~mem4_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem4] {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 22:22:42,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [92] L40-1-->L36-2: Formula: true InVars {} OutVars{main_#t~mem4=|v_main_#t~mem4_3|} AuxVars[] AssignedVars[main_#t~mem4] {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-07 22:22:42,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {3671#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (+ (- 1) main_~index~0) 0))} [93] L36-2-->L36-3: Formula: (= (+ v_main_~index~0_6 1) v_main_~index~0_5) InVars {main_~index~0=v_main_~index~0_6} OutVars{main_#t~post2=|v_main_#t~post2_1|, main_~index~0=v_main_~index~0_5} AuxVars[] AssignedVars[main_~index~0, main_#t~post2] {3593#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:22:42,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {3593#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [83] L36-3-->L37: Formula: (< (mod v_main_~index~0_13 4294967296) 1000) InVars {main_~index~0=v_main_~index~0_13} OutVars{main_~index~0=v_main_~index~0_13} AuxVars[] AssignedVars[] {3593#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-07 22:22:42,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {3593#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4)) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} [85] L37-->L38: Formula: (and (= (mod v_main_~index~0_1 2) 0) (= (select (select |v_#memory_int_1| |v_main_~#array~0.base_1|) (+ (* 4 (mod v_main_~index~0_1 4294967296)) |v_main_~#array~0.offset_1|)) |v_main_#t~mem3_1|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_~#array~0.base=|v_main_~#array~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, main_~index~0=v_main_~index~0_1, main_#t~mem3=|v_main_#t~mem3_1|, main_~#array~0.base=|v_main_~#array~0.base_1|} AuxVars[] AssignedVars[main_#t~mem3] {3705#(= |main_#t~mem3| 0)} is VALID [2022-04-07 22:22:42,208 INFO L272 TraceCheckUtils]: 44: Hoare triple {3705#(= |main_#t~mem3| 0)} [88] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod |v_main_#t~mem3_4| 4294967296) 0) 1 0)) InVars {main_#t~mem3=|v_main_#t~mem3_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem3] {3709#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:22:42,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {3709#(<= 1 |__VERIFIER_assert_#in~cond|)} [91] __VERIFIER_assertENTRY-->L21: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:22:42,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {3713#(<= 1 __VERIFIER_assert_~cond)} [94] L21-->L22: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3534#false} is VALID [2022-04-07 22:22:42,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {3534#false} [96] L22-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3534#false} is VALID [2022-04-07 22:22:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 22:22:42,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:22:58,994 INFO L390 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 210 treesize of output 206 [2022-04-07 22:23:01,459 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-07 22:23:01,497 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 20939538344 treesize of output 20930625448