/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/loops/sum_array-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:06:12,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:06:12,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:06:13,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:06:13,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:06:13,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:06:13,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:06:13,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:06:13,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:06:13,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:06:13,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:06:13,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:06:13,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:06:13,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:06:13,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:06:13,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:06:13,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:06:13,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:06:13,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:06:13,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:06:13,041 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:06:13,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:06:13,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:06:13,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:06:13,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:06:13,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:06:13,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:06:13,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:06:13,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:06:13,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:06:13,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:06:13,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:06:13,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:06:13,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:06:13,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:06:13,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:06:13,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:06:13,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:06:13,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:06:13,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:06:13,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:06:13,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:06:13,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:06:13,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:06:13,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:06:13,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:06:13,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:06:13,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:06:13,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:06:13,080 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:06:13,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:06:13,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:06:13,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:06:13,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:06:13,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:06:13,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:06:13,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:06:13,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:06:13,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:06:13,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:06:13,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:06:13,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:06:13,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:06:13,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:06:13,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:06:13,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:06:13,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:06:13,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:06:13,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:06:13,083 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:06:13,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:06:13,084 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:06:13,084 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-15 00:06:13,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:06:13,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:06:13,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:06:13,300 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:06:13,300 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:06:13,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-2.i [2022-04-15 00:06:13,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e17b92e/4a7ce4f8edc746c78fb267ab51d74eff/FLAG0fded9fe1 [2022-04-15 00:06:13,710 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:06:13,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i [2022-04-15 00:06:13,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e17b92e/4a7ce4f8edc746c78fb267ab51d74eff/FLAG0fded9fe1 [2022-04-15 00:06:14,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e17b92e/4a7ce4f8edc746c78fb267ab51d74eff [2022-04-15 00:06:14,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:06:14,131 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:06:14,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:06:14,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:06:14,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:06:14,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea4563e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14, skipping insertion in model container [2022-04-15 00:06:14,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:06:14,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:06:14,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i[938,951] [2022-04-15 00:06:14,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:06:14,380 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:06:14,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i[938,951] [2022-04-15 00:06:14,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:06:14,420 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:06:14,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14 WrapperNode [2022-04-15 00:06:14,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:06:14,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:06:14,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:06:14,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:06:14,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:06:14,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:06:14,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:06:14,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:06:14,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:06:14,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:06:14,492 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-15 00:06:14,508 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-15 00:06:14,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:06:14,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:06:14,519 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:06:14,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:06:14,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:06:14,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:06:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:06:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:06:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 00:06:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:06:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:06:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:06:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:06:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:06:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:06:14,582 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:06:14,583 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:06:14,827 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:06:14,833 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:06:14,833 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 00:06:14,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:06:14 BoogieIcfgContainer [2022-04-15 00:06:14,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:06:14,835 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:06:14,835 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:06:14,836 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:06:14,838 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:06:14" (1/1) ... [2022-04-15 00:06:14,840 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:06:14,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:06:14 BasicIcfg [2022-04-15 00:06:14,886 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:06:14,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:06:14,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:06:14,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:06:14,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:06:14" (1/4) ... [2022-04-15 00:06:14,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcb9959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:06:14, skipping insertion in model container [2022-04-15 00:06:14,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:06:14" (2/4) ... [2022-04-15 00:06:14,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcb9959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:06:14, skipping insertion in model container [2022-04-15 00:06:14,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:06:14" (3/4) ... [2022-04-15 00:06:14,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcb9959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:06:14, skipping insertion in model container [2022-04-15 00:06:14,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:06:14" (4/4) ... [2022-04-15 00:06:14,895 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_array-2.iqvasr [2022-04-15 00:06:14,899 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:06:14,899 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:06:14,937 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:06:14,944 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-15 00:06:14,945 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:06:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:06:14,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:06:14,964 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:06:14,964 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:06:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:06:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1114027626, now seen corresponding path program 1 times [2022-04-15 00:06:14,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:06:14,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214888938] [2022-04-15 00:06:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:06:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:06:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:15,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:06:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:15,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35#true} is VALID [2022-04-15 00:06:15,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 00:06:15,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 00:06:15,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:06:15,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35#true} is VALID [2022-04-15 00:06:15,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 00:06:15,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 00:06:15,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 00:06:15,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {35#true} is VALID [2022-04-15 00:06:15,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#true} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 00:06:15,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {35#true} is VALID [2022-04-15 00:06:15,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} [117] L34-3-->L34-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 00:06:15,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {36#false} is VALID [2022-04-15 00:06:15,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#false} [125] L38-3-->L38-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 00:06:15,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {36#false} is VALID [2022-04-15 00:06:15,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {36#false} is VALID [2022-04-15 00:06:15,179 INFO L272 TraceCheckUtils]: 13: Hoare triple {36#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {36#false} is VALID [2022-04-15 00:06:15,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {36#false} is VALID [2022-04-15 00:06:15,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} [139] L19-->L20: Formula: (= 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[] {36#false} is VALID [2022-04-15 00:06:15,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 00:06:15,182 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-15 00:06:15,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:06:15,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214888938] [2022-04-15 00:06:15,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214888938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:06:15,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:06:15,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:06:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082616572] [2022-04-15 00:06:15,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:06:15,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-15 00:06:15,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:06:15,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 00:06:15,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:06:15,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:06:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:06:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:06:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:06:15,242 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 00:06:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:15,328 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-15 00:06:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:06:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-15 00:06:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:06:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 00:06:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 00:06:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 00:06:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 00:06:15,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-15 00:06:15,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:06:15,445 INFO L225 Difference]: With dead ends: 55 [2022-04-15 00:06:15,445 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 00:06:15,448 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-15 00:06:15,453 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:06:15,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:06:15,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 00:06:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 00:06:15,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:06:15,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:06:15,479 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:06:15,479 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:06:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:15,482 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 00:06:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 00:06:15,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:06:15,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:06:15,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 00:06:15,484 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 00:06:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:15,489 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 00:06:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 00:06:15,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:06:15,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:06:15,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:06:15,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:06:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:06:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 00:06:15,498 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2022-04-15 00:06:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:06:15,498 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 00:06:15,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 00:06:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 00:06:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:06:15,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:06:15,500 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:06:15,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:06:15,500 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:06:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:06:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2033978408, now seen corresponding path program 1 times [2022-04-15 00:06:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:06:15,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158793257] [2022-04-15 00:06:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:06:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:06:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:15,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:06:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:15,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {204#true} is VALID [2022-04-15 00:06:15,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-15 00:06:15,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-15 00:06:15,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {204#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:06:15,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {204#true} is VALID [2022-04-15 00:06:15,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-15 00:06:15,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-15 00:06:15,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-15 00:06:15,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {209#(= main_~i~0 0)} is VALID [2022-04-15 00:06:15,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#(= main_~i~0 0)} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 00:06:15,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 00:06:15,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 00:06:15,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 00:06:15,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} is VALID [2022-04-15 00:06:15,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296)) 4294967296))} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {211#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} is VALID [2022-04-15 00:06:15,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {211#(and (= main_~i~0 0) (<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (* (div main_~M~0 4294967296) 4294967296)))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {205#false} is VALID [2022-04-15 00:06:15,707 INFO L272 TraceCheckUtils]: 13: Hoare triple {205#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {205#false} is VALID [2022-04-15 00:06:15,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {205#false} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {205#false} is VALID [2022-04-15 00:06:15,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {205#false} [139] L19-->L20: Formula: (= 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[] {205#false} is VALID [2022-04-15 00:06:15,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {205#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#false} is VALID [2022-04-15 00:06:15,708 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-15 00:06:15,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:06:15,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158793257] [2022-04-15 00:06:15,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158793257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:06:15,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:06:15,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:06:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954670872] [2022-04-15 00:06:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:06:15,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-15 00:06:15,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:06:15,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 00:06:15,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:06:15,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:06:15,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:06:15,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:06:15,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:06:15,736 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 00:06:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:16,026 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-15 00:06:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:06:16,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-15 00:06:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:06:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 00:06:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-15 00:06:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 00:06:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-15 00:06:16,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-15 00:06:16,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:06:16,099 INFO L225 Difference]: With dead ends: 62 [2022-04-15 00:06:16,099 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 00:06:16,099 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:06:16,100 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:06:16,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 35 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:06:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 00:06:16,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-15 00:06:16,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:06:16,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:06:16,105 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:06:16,106 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:06:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:16,108 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 00:06:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 00:06:16,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:06:16,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:06:16,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-15 00:06:16,109 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 39 states. [2022-04-15 00:06:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:16,110 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 00:06:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 00:06:16,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:06:16,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:06:16,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:06:16,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:06:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:06:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-15 00:06:16,112 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2022-04-15 00:06:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:06:16,113 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-15 00:06:16,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 00:06:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 00:06:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 00:06:16,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:06:16,113 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:06:16,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:06:16,114 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:06:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:06:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1179844468, now seen corresponding path program 1 times [2022-04-15 00:06:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:06:16,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476893478] [2022-04-15 00:06:16,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:06:16,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:06:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:06:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:16,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {425#true} is VALID [2022-04-15 00:06:16,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:16,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {425#true} {425#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:16,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:06:16,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {425#true} is VALID [2022-04-15 00:06:16,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:16,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:16,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:16,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {431#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {431#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {432#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} is VALID [2022-04-15 00:06:16,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {432#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {433#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {433#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {433#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:06:16,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {433#(and (= (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0)) (select (select |#memory_int| |main_~#C~0.base|) 0)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {432#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} is VALID [2022-04-15 00:06:16,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {432#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {434#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-15 00:06:16,799 INFO L272 TraceCheckUtils]: 21: Hoare triple {434#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:06:16,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {435#(not (= |__VERIFIER_assert_#in~cond| 0))} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {436#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:06:16,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {436#(not (= __VERIFIER_assert_~cond 0))} [139] L19-->L20: Formula: (= 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[] {426#false} is VALID [2022-04-15 00:06:16,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {426#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-15 00:06:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 00:06:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:06:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476893478] [2022-04-15 00:06:16,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476893478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:06:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128513210] [2022-04-15 00:06:16,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:06:16,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:06:16,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:06:16,803 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-15 00:06:16,804 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-15 00:06:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:16,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 00:06:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:16,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:06:16,960 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 14 treesize of output 12 [2022-04-15 00:06:17,083 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 00:06:17,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-04-15 00:06:17,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 00:06:17,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2022-04-15 00:06:17,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:17,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {425#true} is VALID [2022-04-15 00:06:17,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:17,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:17,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:17,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {487#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:17,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {491#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {491#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {491#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {491#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:17,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {491#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {501#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:17,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {501#(and (= (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (+ (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {434#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-15 00:06:17,584 INFO L272 TraceCheckUtils]: 21: Hoare triple {434#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:06:17,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#(<= 1 |__VERIFIER_assert_#in~cond|)} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:06:17,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#(<= 1 __VERIFIER_assert_~cond)} [139] L19-->L20: Formula: (= 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[] {426#false} is VALID [2022-04-15 00:06:17,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {426#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-15 00:06:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 00:06:17,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:06:17,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 00:06:17,757 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 332 treesize of output 312 [2022-04-15 00:06:22,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 00:06:22,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2022-04-15 00:06:22,636 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-04-15 00:06:22,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2022-04-15 00:06:24,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 00:06:24,473 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 53 treesize of output 50 [2022-04-15 00:06:24,755 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-04-15 00:06:24,756 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 38 treesize of output 36 [2022-04-15 00:06:24,853 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-04-15 00:06:24,854 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 92 treesize of output 71 [2022-04-15 00:06:25,080 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-15 00:06:25,081 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 38 treesize of output 1 [2022-04-15 00:06:26,636 INFO L356 Elim1Store]: treesize reduction 10, result has 28.6 percent of original size [2022-04-15 00:06:26,636 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 108 treesize of output 78 [2022-04-15 00:06:28,136 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-15 00:06:28,137 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 92 treesize of output 1 [2022-04-15 00:06:29,125 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-15 00:06:29,125 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 92 treesize of output 1 [2022-04-15 00:06:30,554 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-15 00:06:30,555 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 146 treesize of output 1 [2022-04-15 00:06:30,762 INFO L356 Elim1Store]: treesize reduction 10, result has 28.6 percent of original size [2022-04-15 00:06:30,762 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 167 treesize of output 121 [2022-04-15 00:06:36,745 INFO L356 Elim1Store]: treesize reduction 44, result has 71.2 percent of original size [2022-04-15 00:06:36,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 282 treesize of output 220 [2022-04-15 00:06:37,381 INFO L356 Elim1Store]: treesize reduction 33, result has 74.4 percent of original size [2022-04-15 00:06:37,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 240 treesize of output 205 [2022-04-15 00:06:39,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 00:06:39,037 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 66 treesize of output 54 [2022-04-15 00:06:39,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 00:06:39,204 INFO L356 Elim1Store]: treesize reduction 53, result has 72.3 percent of original size [2022-04-15 00:06:39,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 237 treesize of output 269 [2022-04-15 00:06:39,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:39,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:39,595 INFO L356 Elim1Store]: treesize reduction 128, result has 16.3 percent of original size [2022-04-15 00:06:39,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 160 treesize of output 79 [2022-04-15 00:06:39,678 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-15 00:06:39,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 149 treesize of output 1 [2022-04-15 00:06:39,695 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-15 00:06:39,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 1 [2022-04-15 00:06:39,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:39,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:39,729 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-04-15 00:06:39,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 1 [2022-04-15 00:06:39,773 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-15 00:06:39,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 166 treesize of output 1 [2022-04-15 00:06:39,798 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-15 00:06:39,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 149 treesize of output 1 [2022-04-15 00:06:39,831 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-04-15 00:06:39,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 377 treesize of output 1 [2022-04-15 00:06:39,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:39,868 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-04-15 00:06:39,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 1 [2022-04-15 00:06:40,169 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-04-15 00:06:40,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 1 [2022-04-15 00:06:40,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:40,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:40,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:40,261 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-04-15 00:06:40,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 1 [2022-04-15 00:06:40,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:40,267 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-04-15 00:06:40,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:40,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:40,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2022-04-15 00:06:40,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:40,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:40,320 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-04-15 00:06:40,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1 [2022-04-15 00:06:40,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 00:06:40,360 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-04-15 00:06:40,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 1 [2022-04-15 00:06:40,396 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-04-15 00:06:40,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 1 [2022-04-15 00:06:40,414 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-04-15 00:06:40,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 1 [2022-04-15 00:06:40,439 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-04-15 00:06:40,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 1 [2022-04-15 00:06:40,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {426#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-15 00:06:40,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#(<= 1 __VERIFIER_assert_~cond)} [139] L19-->L20: Formula: (= 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[] {426#false} is VALID [2022-04-15 00:06:40,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#(<= 1 |__VERIFIER_assert_#in~cond|)} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:06:40,575 INFO L272 TraceCheckUtils]: 21: Hoare triple {434#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:06:40,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {531#(= (select (select |#memory_int| |main_~#C~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#C~0.offset|)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#A~0.offset|)) (select (select |#memory_int| |main_~#B~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#B~0.offset|))))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {434#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-15 00:06:40,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {535#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {531#(= (select (select |#memory_int| |main_~#C~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#C~0.offset|)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#A~0.offset|)) (select (select |#memory_int| |main_~#B~0.base|) (+ (* (mod main_~i~0 4294967296) 4) |main_~#B~0.offset|))))} is VALID [2022-04-15 00:06:40,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {535#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {535#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} is VALID [2022-04-15 00:06:40,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {535#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {535#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} is VALID [2022-04-15 00:06:40,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {545#(and (= (* (mod main_~i~0 4294967296) 4) 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {535#(= (select (select |#memory_int| |main_~#C~0.base|) |main_~#C~0.offset|) (+ (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|) (select (select |#memory_int| |main_~#B~0.base|) |main_~#B~0.offset|)))} is VALID [2022-04-15 00:06:40,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {545#(and (= (* (mod main_~i~0 4294967296) 4) 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {456#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:06:40,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:40,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:40,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:40,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {425#true} is VALID [2022-04-15 00:06:40,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-15 00:06:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 00:06:40,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128513210] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:06:40,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:06:40,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 00:06:40,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617750962] [2022-04-15 00:06:40,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:06:40,595 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 00:06:40,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:06:40,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:06:40,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:06:40,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 00:06:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:06:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 00:06:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-04-15 00:06:40,669 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:06:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:41,499 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-15 00:06:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 00:06:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 00:06:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:06:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:06:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-15 00:06:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:06:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-15 00:06:41,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-04-15 00:06:41,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:06:41,582 INFO L225 Difference]: With dead ends: 45 [2022-04-15 00:06:41,582 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 00:06:41,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-04-15 00:06:41,583 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 75 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:06:41,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 62 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:06:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 00:06:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-04-15 00:06:41,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:06:41,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:41,591 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:41,591 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:41,592 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-15 00:06:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-15 00:06:41,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:06:41,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:06:41,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 00:06:41,593 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 00:06:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:41,594 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-15 00:06:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-15 00:06:41,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:06:41,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:06:41,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:06:41,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:06:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-15 00:06:41,596 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 25 [2022-04-15 00:06:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:06:41,596 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-15 00:06:41,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:06:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 00:06:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 00:06:41,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:06:41,597 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:06:41,623 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-15 00:06:41,821 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-15 00:06:41,822 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:06:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:06:41,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1769858614, now seen corresponding path program 1 times [2022-04-15 00:06:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:06:41,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605419979] [2022-04-15 00:06:41,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:06:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:06:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:41,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:06:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:41,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {813#true} is VALID [2022-04-15 00:06:41,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {813#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:41,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {813#true} {813#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:41,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 00:06:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:41,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {813#true} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {813#true} is VALID [2022-04-15 00:06:41,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {813#true} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:41,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {813#true} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:41,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813#true} {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:41,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {813#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:06:41,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {813#true} is VALID [2022-04-15 00:06:41,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {813#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:41,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:41,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {813#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:41,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {813#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {818#(= main_~i~0 0)} is VALID [2022-04-15 00:06:41,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {818#(= main_~i~0 0)} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {818#(= main_~i~0 0)} is VALID [2022-04-15 00:06:42,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {818#(= main_~i~0 0)} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {818#(= main_~i~0 0)} is VALID [2022-04-15 00:06:42,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {818#(= main_~i~0 0)} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {819#(and (<= 0 (div (+ (* (- 1) main_~i~0) 1) 4294967296)) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:06:42,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {819#(and (<= 0 (div (+ (* (- 1) main_~i~0) 1) 4294967296)) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:42,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:42,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:42,006 INFO L272 TraceCheckUtils]: 21: Hoare triple {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {813#true} is VALID [2022-04-15 00:06:42,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {813#true} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {813#true} is VALID [2022-04-15 00:06:42,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {813#true} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:42,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {813#true} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:42,007 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {813#true} {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:42,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [136] L41-1-->L40-2: Formula: true InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~mem13=|v_main_#t~mem13_3|, main_#t~mem14=|v_main_#t~mem14_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:42,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [138] L40-2-->L40-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post11=|v_main_#t~post11_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post11] {826#(<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296)))} is VALID [2022-04-15 00:06:42,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#(<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296)))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {814#false} is VALID [2022-04-15 00:06:42,009 INFO L272 TraceCheckUtils]: 29: Hoare triple {814#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {814#false} is VALID [2022-04-15 00:06:42,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {814#false} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {814#false} is VALID [2022-04-15 00:06:42,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {814#false} [139] L19-->L20: Formula: (= 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[] {814#false} is VALID [2022-04-15 00:06:42,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {814#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {814#false} is VALID [2022-04-15 00:06:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 00:06:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:06:42,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605419979] [2022-04-15 00:06:42,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605419979] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:06:42,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375763184] [2022-04-15 00:06:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:06:42,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:06:42,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:06:42,016 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-15 00:06:42,017 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-15 00:06:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:42,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 00:06:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:06:42,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:06:49,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {813#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:49,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {813#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {813#true} is VALID [2022-04-15 00:06:49,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {813#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:49,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:49,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {813#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:49,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {813#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {818#(= main_~i~0 0)} is VALID [2022-04-15 00:06:49,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {818#(= main_~i~0 0)} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {818#(= main_~i~0 0)} is VALID [2022-04-15 00:06:49,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {818#(= main_~i~0 0)} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {818#(= main_~i~0 0)} is VALID [2022-04-15 00:06:49,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {818#(= main_~i~0 0)} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {855#(= main_~i~0 1)} is VALID [2022-04-15 00:06:49,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#(= main_~i~0 1)} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:49,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:49,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:49,294 INFO L272 TraceCheckUtils]: 21: Hoare triple {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {813#true} is VALID [2022-04-15 00:06:49,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {813#true} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {813#true} is VALID [2022-04-15 00:06:49,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {813#true} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:49,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {813#true} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:49,295 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {813#true} {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:49,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [136] L41-1-->L40-2: Formula: true InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~mem13=|v_main_#t~mem13_3|, main_#t~mem14=|v_main_#t~mem14_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} is VALID [2022-04-15 00:06:49,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {821#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= main_~i~0 0))} [138] L40-2-->L40-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post11=|v_main_#t~post11_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post11] {913#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:06:49,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {913#(and (<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296)) (= (+ (- 1) main_~i~0) 0))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {814#false} is VALID [2022-04-15 00:06:49,297 INFO L272 TraceCheckUtils]: 29: Hoare triple {814#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {814#false} is VALID [2022-04-15 00:06:49,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {814#false} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {814#false} is VALID [2022-04-15 00:06:49,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {814#false} [139] L19-->L20: Formula: (= 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[] {814#false} is VALID [2022-04-15 00:06:49,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {814#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {814#false} is VALID [2022-04-15 00:06:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 00:06:49,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:06:55,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {814#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {814#false} is VALID [2022-04-15 00:06:55,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {814#false} [139] L19-->L20: Formula: (= 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[] {814#false} is VALID [2022-04-15 00:06:55,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {814#false} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {814#false} is VALID [2022-04-15 00:06:55,366 INFO L272 TraceCheckUtils]: 29: Hoare triple {814#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {814#false} is VALID [2022-04-15 00:06:55,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#(<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296)))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {814#false} is VALID [2022-04-15 00:06:55,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {944#(<= (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1))} [138] L40-2-->L40-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post11=|v_main_#t~post11_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post11] {826#(<= (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296)))} is VALID [2022-04-15 00:06:55,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {944#(<= (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1))} [136] L41-1-->L40-2: Formula: true InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~mem13=|v_main_#t~mem13_3|, main_#t~mem14=|v_main_#t~mem14_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {944#(<= (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:06:55,369 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {813#true} {944#(<= (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1))} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {944#(<= (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:06:55,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {813#true} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:55,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {813#true} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:55,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {813#true} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {813#true} is VALID [2022-04-15 00:06:55,369 INFO L272 TraceCheckUtils]: 21: Hoare triple {944#(<= (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {813#true} is VALID [2022-04-15 00:06:55,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {944#(<= (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {944#(<= (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:06:55,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {944#(<= (+ (* (div (+ main_~i~0 1) 4294967296) 4294967296) main_~M~0) (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:06:55,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:55,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:55,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:55,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:55,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:55,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:55,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:55,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:55,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-04-15 00:06:57,570 WARN L290 TraceCheckUtils]: 9: Hoare triple {999#(forall ((aux_div_aux_mod_main_~M~0_26_53 Int) (aux_mod_aux_mod_main_~M~0_26_53 Int)) (or (<= (+ aux_mod_aux_mod_main_~M~0_26_53 4294967295 (* aux_div_aux_mod_main_~M~0_26_53 4294967296)) 0) (< (mod main_~i~0 4294967296) (mod (+ (* aux_mod_aux_mod_main_~M~0_26_53 4294967295) 1) 4294967296)) (<= 0 aux_div_aux_mod_main_~M~0_26_53) (<= 4294967296 aux_mod_aux_mod_main_~M~0_26_53)))} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {820#(<= 0 (div (+ (* (- 1) main_~M~0) (* (div main_~M~0 4294967296) 4294967296) 1) 4294967296))} is UNKNOWN [2022-04-15 00:06:57,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {1003#(forall ((aux_div_aux_mod_main_~M~0_26_53 Int) (aux_mod_aux_mod_main_~M~0_26_53 Int)) (or (<= (+ aux_mod_aux_mod_main_~M~0_26_53 4294967295 (* aux_div_aux_mod_main_~M~0_26_53 4294967296)) 0) (<= 0 aux_div_aux_mod_main_~M~0_26_53) (<= 4294967296 aux_mod_aux_mod_main_~M~0_26_53) (< (mod (+ main_~i~0 1) 4294967296) (mod (+ (* aux_mod_aux_mod_main_~M~0_26_53 4294967295) 1) 4294967296))))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {999#(forall ((aux_div_aux_mod_main_~M~0_26_53 Int) (aux_mod_aux_mod_main_~M~0_26_53 Int)) (or (<= (+ aux_mod_aux_mod_main_~M~0_26_53 4294967295 (* aux_div_aux_mod_main_~M~0_26_53 4294967296)) 0) (< (mod main_~i~0 4294967296) (mod (+ (* aux_mod_aux_mod_main_~M~0_26_53 4294967295) 1) 4294967296)) (<= 0 aux_div_aux_mod_main_~M~0_26_53) (<= 4294967296 aux_mod_aux_mod_main_~M~0_26_53)))} is VALID [2022-04-15 00:06:57,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#(forall ((aux_div_aux_mod_main_~M~0_26_53 Int) (aux_mod_aux_mod_main_~M~0_26_53 Int)) (or (<= (+ aux_mod_aux_mod_main_~M~0_26_53 4294967295 (* aux_div_aux_mod_main_~M~0_26_53 4294967296)) 0) (<= 0 aux_div_aux_mod_main_~M~0_26_53) (<= 4294967296 aux_mod_aux_mod_main_~M~0_26_53) (< (mod (+ main_~i~0 1) 4294967296) (mod (+ (* aux_mod_aux_mod_main_~M~0_26_53 4294967295) 1) 4294967296))))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1003#(forall ((aux_div_aux_mod_main_~M~0_26_53 Int) (aux_mod_aux_mod_main_~M~0_26_53 Int)) (or (<= (+ aux_mod_aux_mod_main_~M~0_26_53 4294967295 (* aux_div_aux_mod_main_~M~0_26_53 4294967296)) 0) (<= 0 aux_div_aux_mod_main_~M~0_26_53) (<= 4294967296 aux_mod_aux_mod_main_~M~0_26_53) (< (mod (+ main_~i~0 1) 4294967296) (mod (+ (* aux_mod_aux_mod_main_~M~0_26_53 4294967295) 1) 4294967296))))} is VALID [2022-04-15 00:06:57,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {1003#(forall ((aux_div_aux_mod_main_~M~0_26_53 Int) (aux_mod_aux_mod_main_~M~0_26_53 Int)) (or (<= (+ aux_mod_aux_mod_main_~M~0_26_53 4294967295 (* aux_div_aux_mod_main_~M~0_26_53 4294967296)) 0) (<= 0 aux_div_aux_mod_main_~M~0_26_53) (<= 4294967296 aux_mod_aux_mod_main_~M~0_26_53) (< (mod (+ main_~i~0 1) 4294967296) (mod (+ (* aux_mod_aux_mod_main_~M~0_26_53 4294967295) 1) 4294967296))))} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1003#(forall ((aux_div_aux_mod_main_~M~0_26_53 Int) (aux_mod_aux_mod_main_~M~0_26_53 Int)) (or (<= (+ aux_mod_aux_mod_main_~M~0_26_53 4294967295 (* aux_div_aux_mod_main_~M~0_26_53 4294967296)) 0) (<= 0 aux_div_aux_mod_main_~M~0_26_53) (<= 4294967296 aux_mod_aux_mod_main_~M~0_26_53) (< (mod (+ main_~i~0 1) 4294967296) (mod (+ (* aux_mod_aux_mod_main_~M~0_26_53 4294967295) 1) 4294967296))))} is VALID [2022-04-15 00:06:57,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {813#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {1003#(forall ((aux_div_aux_mod_main_~M~0_26_53 Int) (aux_mod_aux_mod_main_~M~0_26_53 Int)) (or (<= (+ aux_mod_aux_mod_main_~M~0_26_53 4294967295 (* aux_div_aux_mod_main_~M~0_26_53 4294967296)) 0) (<= 0 aux_div_aux_mod_main_~M~0_26_53) (<= 4294967296 aux_mod_aux_mod_main_~M~0_26_53) (< (mod (+ main_~i~0 1) 4294967296) (mod (+ (* aux_mod_aux_mod_main_~M~0_26_53 4294967295) 1) 4294967296))))} is VALID [2022-04-15 00:06:57,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {813#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:57,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:57,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {813#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:57,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {813#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {813#true} is VALID [2022-04-15 00:06:57,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {813#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-15 00:06:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 00:06:57,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375763184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:06:57,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:06:57,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-15 00:06:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216800929] [2022-04-15 00:06:57,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:06:57,653 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-15 00:06:57,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:06:57,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:00,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:00,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 00:07:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:07:00,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 00:07:00,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2022-04-15 00:07:00,130 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:00,623 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-04-15 00:07:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 00:07:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-15 00:07:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:07:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-15 00:07:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-15 00:07:00,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 74 transitions. [2022-04-15 00:07:00,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:00,701 INFO L225 Difference]: With dead ends: 80 [2022-04-15 00:07:00,701 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 00:07:00,701 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=95, Invalid=284, Unknown=1, NotChecked=0, Total=380 [2022-04-15 00:07:00,702 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 62 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:00,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 51 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 144 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2022-04-15 00:07:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 00:07:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-04-15 00:07:00,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:00,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:00,719 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:00,720 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:00,721 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-15 00:07:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-15 00:07:00,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:00,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:00,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 00:07:00,722 INFO L87 Difference]: Start difference. First operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 00:07:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:00,724 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-15 00:07:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-15 00:07:00,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:00,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:00,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:00,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-04-15 00:07:00,726 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 33 [2022-04-15 00:07:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:00,726 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-04-15 00:07:00,726 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 00:07:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 00:07:00,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:00,727 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:07:00,750 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-15 00:07:00,949 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-15 00:07:00,950 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1140994972, now seen corresponding path program 2 times [2022-04-15 00:07:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:00,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735405076] [2022-04-15 00:07:00,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:00,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:01,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {1312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1298#true} is VALID [2022-04-15 00:07:01,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1298#true} {1298#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 00:07:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:01,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {1298#true} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1298#true} is VALID [2022-04-15 00:07:01,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {1298#true} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1298#true} {1299#false} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {1298#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:01,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {1312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1298#true} is VALID [2022-04-15 00:07:01,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {1298#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1298#true} {1298#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {1298#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {1298#true} is VALID [2022-04-15 00:07:01,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {1298#true} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} is VALID [2022-04-15 00:07:01,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} is VALID [2022-04-15 00:07:01,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1304#(<= (+ (* (div main_~i~0 4294967296) 4294967296) 1) main_~i~0)} is VALID [2022-04-15 00:07:01,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {1304#(<= (+ (* (div main_~i~0 4294967296) 4294967296) 1) main_~i~0)} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-15 00:07:01,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-15 00:07:01,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-15 00:07:01,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1307#(and (<= (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1) main_~M~0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:01,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {1307#(and (<= (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296) 1) main_~M~0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {1299#false} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {1299#false} is VALID [2022-04-15 00:07:01,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {1299#false} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {1299#false} is VALID [2022-04-15 00:07:01,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#false} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {1299#false} is VALID [2022-04-15 00:07:01,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {1299#false} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {1299#false} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {1299#false} is VALID [2022-04-15 00:07:01,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {1299#false} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,120 INFO L272 TraceCheckUtils]: 24: Hoare triple {1299#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1298#true} is VALID [2022-04-15 00:07:01,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {1298#true} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1298#true} is VALID [2022-04-15 00:07:01,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#true} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {1298#true} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,120 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1298#true} {1299#false} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {1299#false} [136] L41-1-->L40-2: Formula: true InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~mem13=|v_main_#t~mem13_3|, main_#t~mem14=|v_main_#t~mem14_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {1299#false} [138] L40-2-->L40-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post11=|v_main_#t~post11_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post11] {1299#false} is VALID [2022-04-15 00:07:01,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {1299#false} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,120 INFO L272 TraceCheckUtils]: 32: Hoare triple {1299#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {1299#false} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1299#false} is VALID [2022-04-15 00:07:01,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {1299#false} [139] L19-->L20: Formula: (= 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[] {1299#false} is VALID [2022-04-15 00:07:01,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {1299#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 00:07:01,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:01,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735405076] [2022-04-15 00:07:01,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735405076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:07:01,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250251459] [2022-04-15 00:07:01,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:07:01,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:07:01,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:07:01,127 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-15 00:07:01,128 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-15 00:07:01,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:07:01,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:07:01,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 00:07:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:01,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:07:01,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {1298#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1298#true} is VALID [2022-04-15 00:07:01,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1298#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1298#true} {1298#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {1298#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {1331#(= main_~i~0 0)} is VALID [2022-04-15 00:07:01,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1331#(= main_~i~0 0)} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1331#(= main_~i~0 0)} is VALID [2022-04-15 00:07:01,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1331#(= main_~i~0 0)} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1331#(= main_~i~0 0)} is VALID [2022-04-15 00:07:01,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {1331#(= main_~i~0 0)} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1341#(= main_~i~0 1)} is VALID [2022-04-15 00:07:01,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {1341#(= main_~i~0 1)} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-15 00:07:01,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-15 00:07:01,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-15 00:07:01,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#(and (= main_~i~0 0) (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1366#(and (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:07:01,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {1366#(and (<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0) (= (+ (- 1) main_~i~0) 0))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {1299#false} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {1299#false} is VALID [2022-04-15 00:07:01,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {1299#false} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {1299#false} is VALID [2022-04-15 00:07:01,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#false} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {1299#false} is VALID [2022-04-15 00:07:01,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {1299#false} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {1299#false} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {1299#false} is VALID [2022-04-15 00:07:01,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {1299#false} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,604 INFO L272 TraceCheckUtils]: 24: Hoare triple {1299#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {1299#false} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1299#false} is VALID [2022-04-15 00:07:01,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {1299#false} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {1299#false} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,605 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1299#false} {1299#false} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {1299#false} [136] L41-1-->L40-2: Formula: true InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~mem13=|v_main_#t~mem13_3|, main_#t~mem14=|v_main_#t~mem14_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {1299#false} [138] L40-2-->L40-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post11=|v_main_#t~post11_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post11] {1299#false} is VALID [2022-04-15 00:07:01,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {1299#false} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,605 INFO L272 TraceCheckUtils]: 32: Hoare triple {1299#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {1299#false} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1299#false} is VALID [2022-04-15 00:07:01,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {1299#false} [139] L19-->L20: Formula: (= 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[] {1299#false} is VALID [2022-04-15 00:07:01,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {1299#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 00:07:01,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:07:01,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {1299#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {1299#false} [139] L19-->L20: Formula: (= 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[] {1299#false} is VALID [2022-04-15 00:07:01,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {1299#false} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1299#false} is VALID [2022-04-15 00:07:01,966 INFO L272 TraceCheckUtils]: 32: Hoare triple {1299#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {1299#false} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {1299#false} [138] L40-2-->L40-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post11=|v_main_#t~post11_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post11] {1299#false} is VALID [2022-04-15 00:07:01,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {1299#false} [136] L41-1-->L40-2: Formula: true InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~mem13=|v_main_#t~mem13_3|, main_#t~mem14=|v_main_#t~mem14_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,966 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1298#true} {1299#false} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {1298#true} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#true} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {1298#true} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1298#true} is VALID [2022-04-15 00:07:01,967 INFO L272 TraceCheckUtils]: 24: Hoare triple {1299#false} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1298#true} is VALID [2022-04-15 00:07:01,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {1299#false} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1299#false} is VALID [2022-04-15 00:07:01,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {1299#false} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {1299#false} is VALID [2022-04-15 00:07:01,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {1299#false} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#false} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {1299#false} is VALID [2022-04-15 00:07:01,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {1299#false} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {1299#false} is VALID [2022-04-15 00:07:01,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {1299#false} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {1299#false} is VALID [2022-04-15 00:07:01,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {1478#(< (mod main_~i~0 4294967296) (mod main_~M~0 4294967296))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-15 00:07:01,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {1482#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~M~0 4294967296))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1478#(< (mod main_~i~0 4294967296) (mod main_~M~0 4294967296))} is VALID [2022-04-15 00:07:01,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {1482#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~M~0 4294967296))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1482#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~M~0 4294967296))} is VALID [2022-04-15 00:07:01,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {1482#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~M~0 4294967296))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {1482#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~M~0 4294967296))} is VALID [2022-04-15 00:07:01,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {1482#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~M~0 4294967296))} is VALID [2022-04-15 00:07:01,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {1304#(<= (+ (* (div main_~i~0 4294967296) 4294967296) 1) main_~i~0)} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1305#(<= (+ 2 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0)} is VALID [2022-04-15 00:07:01,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1304#(<= (+ (* (div main_~i~0 4294967296) 4294967296) 1) main_~i~0)} is VALID [2022-04-15 00:07:01,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} is VALID [2022-04-15 00:07:01,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} is VALID [2022-04-15 00:07:01,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {1303#(<= main_~i~0 (+ 4294967294 (* (div main_~i~0 4294967296) 4294967296)))} is VALID [2022-04-15 00:07:01,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {1298#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1298#true} {1298#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {1298#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1298#true} is VALID [2022-04-15 00:07:01,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {1298#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-15 00:07:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 00:07:01,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250251459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:07:01,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:07:01,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-15 00:07:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389482905] [2022-04-15 00:07:01,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:07:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-15 00:07:01,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:07:01,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:07:02,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:02,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 00:07:02,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:07:02,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 00:07:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:07:02,019 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:07:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:02,809 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2022-04-15 00:07:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 00:07:02,810 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-15 00:07:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:07:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:07:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-04-15 00:07:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:07:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-04-15 00:07:02,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 83 transitions. [2022-04-15 00:07:02,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:02,910 INFO L225 Difference]: With dead ends: 83 [2022-04-15 00:07:02,910 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 00:07:02,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-04-15 00:07:02,911 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 142 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:02,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 59 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:07:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 00:07:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2022-04-15 00:07:02,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:02,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:02,926 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:02,927 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:02,928 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-04-15 00:07:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-15 00:07:02,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:02,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:02,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 62 states. [2022-04-15 00:07:02,929 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 62 states. [2022-04-15 00:07:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:02,930 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-04-15 00:07:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-15 00:07:02,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:02,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:02,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:02,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-15 00:07:02,932 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 36 [2022-04-15 00:07:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:02,932 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-15 00:07:02,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:07:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 00:07:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 00:07:02,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:02,933 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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-15 00:07:02,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 00:07:03,143 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-15 00:07:03,144 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1497787256, now seen corresponding path program 3 times [2022-04-15 00:07:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:03,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197178819] [2022-04-15 00:07:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:04,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {1873#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1852#true} is VALID [2022-04-15 00:07:04,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {1852#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:04,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1852#true} {1852#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:04,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 00:07:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:04,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {1852#true} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1852#true} is VALID [2022-04-15 00:07:04,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {1852#true} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:04,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {1852#true} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:04,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1852#true} {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} is VALID [2022-04-15 00:07:04,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {1852#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1873#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:04,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {1873#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1852#true} is VALID [2022-04-15 00:07:04,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {1852#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:04,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1852#true} {1852#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:04,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {1852#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:04,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {1852#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-15 00:07:04,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1859#(and (<= (+ (* (div main_~M~0 4294967296) 4294967296) (* main_~i~0 2)) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-15 00:07:04,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {1859#(and (<= (+ (* (div main_~M~0 4294967296) 4294967296) (* main_~i~0 2)) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1859#(and (<= (+ (* (div main_~M~0 4294967296) 4294967296) (* main_~i~0 2)) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-15 00:07:04,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {1859#(and (<= (+ (* (div main_~M~0 4294967296) 4294967296) (* main_~i~0 2)) (+ main_~M~0 (* (div main_~i~0 4294967296) 4294967296))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1860#(and (= |main_~#B~0.offset| 0) (or (< (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0) (not (= |main_~#C~0.base| |main_~#A~0.base|))) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0) (<= (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} is VALID [2022-04-15 00:07:04,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {1860#(and (= |main_~#B~0.offset| 0) (or (< (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0) (not (= |main_~#C~0.base| |main_~#A~0.base|))) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0) (<= (+ main_~i~0 (* (div main_~M~0 4294967296) 4294967296)) main_~M~0))} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {1861#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {1861#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-15 00:07:04,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-15 00:07:04,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-15 00:07:04,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1861#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {1861#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {1861#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {1861#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0))} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {1857#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} is VALID [2022-04-15 00:07:04,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {1858#(and (= |main_~#B~0.offset| 0) (<= main_~i~0 1) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= |main_~#C~0.offset| 0) (<= 1 main_~i~0))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {1862#(and (<= (div main_~i~0 4294967296) 0) (= (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4)) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (< 0 (+ (div main_~i~0 4294967296) 1)) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} is VALID [2022-04-15 00:07:04,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {1862#(and (<= (div main_~i~0 4294967296) 0) (= (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4)) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (= |main_~#B~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))) (< 0 (+ (div main_~i~0 4294967296) 1)) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {1863#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} is VALID [2022-04-15 00:07:04,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {1863#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {1863#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} is VALID [2022-04-15 00:07:04,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {1863#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} is VALID [2022-04-15 00:07:04,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} is VALID [2022-04-15 00:07:04,319 INFO L272 TraceCheckUtils]: 29: Hoare triple {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1852#true} is VALID [2022-04-15 00:07:04,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {1852#true} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1852#true} is VALID [2022-04-15 00:07:04,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {1852#true} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:04,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {1852#true} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:04,321 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1852#true} {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} is VALID [2022-04-15 00:07:04,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} [136] L41-1-->L40-2: Formula: true InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~mem13=|v_main_#t~mem13_3|, main_#t~mem14=|v_main_#t~mem14_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} is VALID [2022-04-15 00:07:04,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {1864#(and (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= main_~i~0 0) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#B~0.offset| 4)) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (div (+ (* (- 1) |main_~#A~0.offset|) |main_~#B~0.offset| 4) 4) 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4)))))} [138] L40-2-->L40-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post11=|v_main_#t~post11_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post11] {1869#(and (<= (div main_~i~0 4294967296) 0) (= |main_~#B~0.offset| 0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} is VALID [2022-04-15 00:07:04,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {1869#(and (<= (div main_~i~0 4294967296) 0) (= |main_~#B~0.offset| 0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (= |main_~#A~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (+ (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)) (* main_~i~0 4))))))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1870#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-15 00:07:04,326 INFO L272 TraceCheckUtils]: 37: Hoare triple {1870#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1871#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:07:04,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {1871#(not (= |__VERIFIER_assert_#in~cond| 0))} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1872#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:07:04,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {1872#(not (= __VERIFIER_assert_~cond 0))} [139] L19-->L20: Formula: (= 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[] {1853#false} is VALID [2022-04-15 00:07:04,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {1853#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1853#false} is VALID [2022-04-15 00:07:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:04,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197178819] [2022-04-15 00:07:04,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197178819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:07:04,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945700891] [2022-04-15 00:07:04,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 00:07:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:07:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:07:04,328 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-15 00:07:04,329 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-15 00:07:04,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-15 00:07:04,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:07:04,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 00:07:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:04,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:07:04,440 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-15 00:07:04,442 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 23 treesize of output 19 [2022-04-15 00:07:04,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 00:07:04,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-15 00:07:04,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-15 00:07:04,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-04-15 00:07:04,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-04-15 00:07:13,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 17 [2022-04-15 00:07:13,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {1852#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:13,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1852#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= (select |v_#valid_17| 2) 1) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select .cse0 1) 0) (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_17| 0) 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1852#true} is VALID [2022-04-15 00:07:13,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {1852#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:13,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1852#true} {1852#true} [144] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:13,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {1852#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1852#true} is VALID [2022-04-15 00:07:13,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1852#true} [109] mainENTRY-->L30-3: Formula: (let ((.cse0 (store |v_#valid_4| |v_main_~#A~0.base_2| 1))) (let ((.cse2 (store .cse0 |v_main_~#B~0.base_2| 1))) (and (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_2|) (= |v_main_~#C~0.offset_2| 0) (= (select .cse0 |v_main_~#B~0.base_2|) 0) (not (= |v_main_~#B~0.base_2| 0)) (= (select |v_#valid_4| |v_main_~#A~0.base_2|) 0) (= |v_#length_1| (let ((.cse1 (* (mod v_main_~M~0_3 4294967296) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_2| .cse1) |v_main_~#B~0.base_2| .cse1) |v_main_~#C~0.base_2| .cse1))) (= v_main_~M~0_3 |v_main_#t~nondet1_2|) (= v_main_~i~0_6 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store .cse2 |v_main_~#C~0.base_2| 1)) (= 0 |v_main_~#B~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_2|) (= 0 (select .cse2 |v_main_~#C~0.base_2|)) (not (= |v_main_~#A~0.base_2| 0)) (not (= |v_main_~#C~0.base_2| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, main_#t~nondet1=|v_main_#t~nondet1_2|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_2|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_2|, main_~i~0=v_main_~i~0_6, main_~M~0=v_main_~M~0_3, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|, main_~#C~0.base=|v_main_~#C~0.base_2|} AuxVars[] AssignedVars[main_~#B~0.offset, main_~#C~0.offset, main_#t~nondet1, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1902#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {1902#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [113] L30-3-->L32: Formula: (let ((.cse1 (mod v_main_~i~0_9 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#A~0.offset_5|))) (and (= |v_main_#t~mem4_1| (select (select |v_#memory_int_2| |v_main_~#A~0.base_5|) .cse0)) (<= |v_main_#t~nondet3_2| 2147483647) (< .cse1 (mod v_main_~M~0_5 4294967296)) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) .cse0 |v_main_#t~nondet3_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))))) InVars {main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_3|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~i~0=v_main_~i~0_9, #memory_int=|v_#memory_int_2|, main_~M~0=v_main_~M~0_5, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4, main_#t~nondet3, #memory_int] {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [116] L32-->L30-2: Formula: (<= |v_main_#t~mem4_5| 1000000) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [121] L30-2-->L30-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [112] L30-3-->L30-4: Formula: (not (< (mod v_main_~i~0_8 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_8, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [114] L30-4-->L34-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1902#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {1902#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [119] L34-3-->L36: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#B~0.offset_7|))) (and (<= |v_main_#t~nondet6_2| 2147483647) (= |v_main_#t~mem7_1| (select (select |v_#memory_int_4| |v_main_~#B~0.base_7|) .cse0)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_5| |v_main_~#B~0.base_7| (store (select |v_#memory_int_5| |v_main_~#B~0.base_7|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_4|) (< .cse1 (mod v_main_~M~0_7 4294967296))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_7|, main_~#B~0.base=|v_main_~#B~0.base_7|, main_#t~mem7=|v_main_#t~mem7_1|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_4|, main_~M~0=v_main_~M~0_7} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [124] L36-->L34-2: Formula: (<= |v_main_#t~mem7_5| 1000000) InVars {main_#t~mem7=|v_main_#t~mem7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [128] L34-2-->L34-3: Formula: (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) InVars {main_~i~0=v_main_~i~0_16} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post5] {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [118] L34-3-->L34-4: Formula: (not (< (mod v_main_~i~0_13 4294967296) (mod v_main_~M~0_6 4294967296))) InVars {main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} OutVars{main_~i~0=v_main_~i~0_13, main_~M~0=v_main_~M~0_6} AuxVars[] AssignedVars[] {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {1906#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [122] L34-4-->L38-3: Formula: (= v_main_~i~0_17 0) InVars {} OutVars{main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_~i~0] {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {1892#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {1902#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} is VALID [2022-04-15 00:07:13,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {1902#(and (= main_~i~0 1) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)))} [127] L38-3-->L38-2: Formula: (let ((.cse1 (mod v_main_~i~0_19 4294967296))) (and (= (store |v_#memory_int_7| |v_main_~#C~0.base_9| (let ((.cse0 (* .cse1 4))) (store (select |v_#memory_int_7| |v_main_~#C~0.base_9|) (+ |v_main_~#C~0.offset_9| .cse0) (+ (select (select |v_#memory_int_7| |v_main_~#B~0.base_10|) (+ |v_main_~#B~0.offset_10| .cse0)) (select (select |v_#memory_int_7| |v_main_~#A~0.base_10|) (+ |v_main_~#A~0.offset_10| .cse0)))))) |v_#memory_int_6|) (< .cse1 (mod v_main_~M~0_9 4294967296)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_10|, main_~#C~0.offset=|v_main_~#C~0.offset_9|, main_~#A~0.offset=|v_main_~#A~0.offset_10|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#B~0.base=|v_main_~#B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_19, main_~M~0=v_main_~M~0_9, main_#t~mem9=|v_main_#t~mem9_1|, main_~#A~0.base=|v_main_~#A~0.base_10|, main_~#C~0.base=|v_main_~#C~0.base_9|} AuxVars[] AssignedVars[main_#t~mem10, #memory_int, main_#t~mem9] {1952#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} is VALID [2022-04-15 00:07:13,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {1952#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} [130] L38-2-->L38-3: Formula: (= v_main_~i~0_20 (+ v_main_~i~0_21 1)) InVars {main_~i~0=v_main_~i~0_21} OutVars{main_~i~0=v_main_~i~0_20, main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post8] {1952#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} is VALID [2022-04-15 00:07:13,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {1952#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} [126] L38-3-->L38-4: Formula: (not (< (mod v_main_~i~0_18 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_18, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {1952#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} is VALID [2022-04-15 00:07:13,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {1952#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} [129] L38-4-->L40-3: Formula: (= v_main_~i~0_1 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {1962#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} is VALID [2022-04-15 00:07:13,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {1962#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1962#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} is VALID [2022-04-15 00:07:13,900 INFO L272 TraceCheckUtils]: 29: Hoare triple {1962#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1969#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (* (- 1) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 00:07:13,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {1969#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (* (- 1) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|))))} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1969#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (* (- 1) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 00:07:13,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {1969#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (* (- 1) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|))))} [140] L19-->L19-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1969#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (* (- 1) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 00:07:13,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {1969#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (* (- 1) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|))))} [143] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1969#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (* (- 1) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|))))} is VALID [2022-04-15 00:07:13,905 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1969#(exists ((|v_main_~#C~0.base_BEFORE_CALL_1| Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (|v_main_~#C~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.offset_BEFORE_CALL_1| Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (and (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#C~0.base_BEFORE_CALL_1|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 4)) (+ (select (select |#memory_int| |v_main_~#C~0.base_BEFORE_CALL_1|) (+ |v_main_~#C~0.offset_BEFORE_CALL_1| 4)) (* (- 1) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) (+ |v_main_~#B~0.offset_BEFORE_CALL_1| 4))))) (not (= |v_main_~#C~0.base_BEFORE_CALL_1| |v_main_~#B~0.base_BEFORE_CALL_1|))))} {1962#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} [146] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1962#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} is VALID [2022-04-15 00:07:13,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {1962#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} [136] L41-1-->L40-2: Formula: true InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_#t~mem13=|v_main_#t~mem13_3|, main_#t~mem14=|v_main_#t~mem14_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1962#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} is VALID [2022-04-15 00:07:13,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {1962#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (= main_~i~0 0) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} [138] L40-2-->L40-3: Formula: (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post11=|v_main_#t~post11_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post11] {1988#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (+ (- 1) main_~i~0) 0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} is VALID [2022-04-15 00:07:13,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {1988#(and (not (= |main_~#B~0.base| |main_~#C~0.base|)) (not (= |main_~#C~0.base| |main_~#A~0.base|)) (not (= |main_~#B~0.base| |main_~#A~0.base|)) (= (+ (- 1) main_~i~0) 0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4)) (+ (select (select |#memory_int| |main_~#C~0.base|) (+ |main_~#C~0.offset| 4)) (* (- 1) (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4))))))} [133] L40-3-->L41: Formula: (let ((.cse1 (mod v_main_~i~0_3 4294967296))) (let ((.cse0 (* .cse1 4))) (and (= (select (select |v_#memory_int_1| |v_main_~#B~0.base_1|) (+ .cse0 |v_main_~#B~0.offset_1|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ .cse0 |v_main_~#A~0.offset_1|)) |v_main_#t~mem12_1|) (< .cse1 (mod v_main_~M~0_2 4294967296)) (= |v_main_#t~mem14_1| (select (select |v_#memory_int_1| |v_main_~#C~0.base_1|) (+ |v_main_~#C~0.offset_1| .cse0)))))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~M~0=v_main_~M~0_2, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#B~0.offset=|v_main_~#B~0.offset_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_3, #memory_int=|v_#memory_int_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_#t~mem14] {1870#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} is VALID [2022-04-15 00:07:13,916 INFO L272 TraceCheckUtils]: 37: Hoare triple {1870#(= |main_#t~mem14| (+ |main_#t~mem12| |main_#t~mem13|))} [135] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ |v_main_#t~mem13_4| |v_main_#t~mem12_4|) |v_main_#t~mem14_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14] {1995#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:07:13,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {1995#(<= 1 |__VERIFIER_assert_#in~cond|)} [137] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1999#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:07:13,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {1999#(<= 1 __VERIFIER_assert_~cond)} [139] L19-->L20: Formula: (= 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[] {1853#false} is VALID [2022-04-15 00:07:13,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {1853#false} [141] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1853#false} is VALID [2022-04-15 00:07:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:13,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:07:19,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#C~0.offset| Int)) (let ((.cse1 (let ((.cse2 (* (mod c_main_~i~0 4294967296) 4))) (store (select |c_#memory_int| |c_main_~#C~0.base|) (+ .cse2 |main_~#C~0.offset|) (+ (select (select |c_#memory_int| |c_main_~#B~0.base|) (+ .cse2 |c_main_~#B~0.offset|)) (select (select |c_#memory_int| |c_main_~#A~0.base|) (+ .cse2 |c_main_~#A~0.offset|))))))) (= (let ((.cse0 (store |c_#memory_int| |c_main_~#C~0.base| .cse1))) (+ (select (select .cse0 |c_main_~#A~0.base|) (+ 4 |c_main_~#A~0.offset|)) (select (select .cse0 |c_main_~#B~0.base|) (+ |c_main_~#B~0.offset| 4)))) (select .cse1 (+ |main_~#C~0.offset| 4))))) is different from false [2022-04-15 00:07:21,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#C~0.offset| Int)) (let ((.cse0 (let ((.cse2 (* (mod (+ c_main_~i~0 1) 4294967296) 4))) (store (select |c_#memory_int| |c_main_~#C~0.base|) (+ .cse2 |main_~#C~0.offset|) (+ (select (select |c_#memory_int| |c_main_~#A~0.base|) (+ .cse2 |c_main_~#A~0.offset|)) (select (select |c_#memory_int| |c_main_~#B~0.base|) (+ .cse2 |c_main_~#B~0.offset|))))))) (= (select .cse0 (+ |main_~#C~0.offset| 4)) (let ((.cse1 (store |c_#memory_int| |c_main_~#C~0.base| .cse0))) (+ (select (select .cse1 |c_main_~#A~0.base|) (+ 4 |c_main_~#A~0.offset|)) (select (select .cse1 |c_main_~#B~0.base|) (+ |c_main_~#B~0.offset| 4))))))) is different from false [2022-04-15 00:07:21,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#C~0.offset| Int) (v_ArrVal_168 (Array Int Int))) (let ((.cse1 (let ((.cse2 (* (mod (+ c_main_~i~0 1) 4294967296) 4))) (store v_ArrVal_168 (+ .cse2 |main_~#C~0.offset|) (let ((.cse3 (store |c_#memory_int| |c_main_~#C~0.base| v_ArrVal_168))) (+ (select (select .cse3 |c_main_~#A~0.base|) (+ .cse2 |c_main_~#A~0.offset|)) (select (select .cse3 |c_main_~#B~0.base|) (+ .cse2 |c_main_~#B~0.offset|)))))))) (= (let ((.cse0 (store |c_#memory_int| |c_main_~#C~0.base| .cse1))) (+ (select (select .cse0 |c_main_~#B~0.base|) (+ |c_main_~#B~0.offset| 4)) (select (select .cse0 |c_main_~#A~0.base|) (+ 4 |c_main_~#A~0.offset|)))) (select .cse1 (+ |main_~#C~0.offset| 4))))) is different from false [2022-04-15 00:07:21,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#C~0.offset| Int) (v_ArrVal_168 (Array Int Int))) (let ((.cse2 (+ |c_main_~#B~0.offset| 4)) (.cse3 (+ 4 |c_main_~#A~0.offset|))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_main_~#C~0.base| v_ArrVal_168))) (+ (select (select .cse4 |c_main_~#B~0.base|) .cse2) (select (select .cse4 |c_main_~#A~0.base|) .cse3))))) (= .cse0 (let ((.cse1 (store |c_#memory_int| |c_main_~#C~0.base| (store v_ArrVal_168 (+ |main_~#C~0.offset| 4) .cse0)))) (+ (select (select .cse1 |c_main_~#B~0.base|) .cse2) (select (select .cse1 |c_main_~#A~0.base|) .cse3))))))) is different from false [2022-04-15 00:07:21,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_166 Int) (|main_~#B~0.offset| Int) (|main_~#C~0.offset| Int) (v_ArrVal_168 (Array Int Int))) (let ((.cse2 (+ |main_~#B~0.offset| 4)) (.cse3 (+ 4 |c_main_~#A~0.offset|)) (.cse4 (store |c_#memory_int| |c_main_~#B~0.base| (store (select |c_#memory_int| |c_main_~#B~0.base|) (+ (* (mod c_main_~i~0 4294967296) 4) |main_~#B~0.offset|) v_ArrVal_166)))) (let ((.cse0 (let ((.cse5 (store .cse4 |c_main_~#C~0.base| v_ArrVal_168))) (+ (select (select .cse5 |c_main_~#B~0.base|) .cse2) (select (select .cse5 |c_main_~#A~0.base|) .cse3))))) (= .cse0 (let ((.cse1 (store .cse4 |c_main_~#C~0.base| (store v_ArrVal_168 (+ |main_~#C~0.offset| 4) .cse0)))) (+ (select (select .cse1 |c_main_~#B~0.base|) .cse2) (select (select .cse1 |c_main_~#A~0.base|) .cse3))))))) is different from false [2022-04-15 00:07:21,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_166 Int) (|main_~#B~0.offset| Int) (|main_~#C~0.offset| Int) (v_ArrVal_168 (Array Int Int))) (let ((.cse1 (+ 4 |c_main_~#A~0.offset|)) (.cse2 (+ |main_~#B~0.offset| 4)) (.cse3 (store |c_#memory_int| |c_main_~#B~0.base| (store (select |c_#memory_int| |c_main_~#B~0.base|) (+ (* (mod (+ c_main_~i~0 1) 4294967296) 4) |main_~#B~0.offset|) v_ArrVal_166)))) (let ((.cse4 (let ((.cse5 (store .cse3 |c_main_~#C~0.base| v_ArrVal_168))) (+ (select (select .cse5 |c_main_~#A~0.base|) .cse1) (select (select .cse5 |c_main_~#B~0.base|) .cse2))))) (= (let ((.cse0 (store .cse3 |c_main_~#C~0.base| (store v_ArrVal_168 (+ |main_~#C~0.offset| 4) .cse4)))) (+ (select (select .cse0 |c_main_~#A~0.base|) .cse1) (select (select .cse0 |c_main_~#B~0.base|) .cse2))) .cse4)))) is different from false [2022-04-15 00:07:22,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 00:07:22,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 132 [2022-04-15 00:07:22,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|main_~#B~0.offset| Int) (|main_~#C~0.offset| Int) (v_ArrVal_168 (Array Int Int))) (let ((.cse1 (+ 4 |c_main_~#A~0.offset|)) (.cse2 (+ |main_~#B~0.offset| 4)) (.cse3 (store |c_#memory_int| |c_main_~#B~0.base| v_arrayElimArr_1))) (let ((.cse4 (let ((.cse5 (store .cse3 |c_main_~#C~0.base| v_ArrVal_168))) (+ (select (select .cse5 |c_main_~#A~0.base|) .cse1) (select (select .cse5 |c_main_~#B~0.base|) .cse2))))) (= (let ((.cse0 (store .cse3 |c_main_~#C~0.base| (store v_ArrVal_168 (+ |main_~#C~0.offset| 4) .cse4)))) (+ (select (select .cse0 |c_main_~#A~0.base|) .cse1) (select (select .cse0 |c_main_~#B~0.base|) .cse2))) .cse4)))) is different from false [2022-04-15 00:07:22,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 00:07:22,331 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 132 [2022-04-15 00:07:22,427 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 3106 treesize of output 2830 [2022-04-15 00:07:22,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 00:07:22,492 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 2606 treesize of output 2202 [2022-04-15 00:07:22,837 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 00:07:22,838 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 4130 treesize of output 3038