./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea0eb860624f2529729bf06b2cf9cdf66fc11dde388f7654e825b0ff58526d73 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:26:35,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:26:35,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:26:35,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:26:35,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:26:35,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:26:35,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:26:35,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:26:35,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:26:35,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:26:35,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:26:35,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:26:35,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:26:35,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:26:35,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:26:35,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:26:35,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:26:35,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:26:35,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:26:35,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:26:35,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:26:35,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:26:35,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:26:35,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:26:35,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:26:35,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:26:35,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:26:35,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:26:35,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:26:35,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:26:35,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:26:35,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:26:35,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:26:35,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:26:35,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:26:35,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:26:35,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:26:35,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:26:35,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:26:35,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:26:35,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:26:35,469 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:26:35,494 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:26:35,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:26:35,495 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:26:35,495 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:26:35,496 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:26:35,496 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:26:35,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:26:35,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:26:35,497 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:26:35,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:26:35,498 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:26:35,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:26:35,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:26:35,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:26:35,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:26:35,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:26:35,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:26:35,499 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:26:35,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:26:35,499 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:26:35,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:26:35,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:26:35,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:26:35,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:26:35,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:35,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:26:35,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:26:35,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:26:35,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:26:35,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:26:35,502 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:26:35,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:26:35,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:26:35,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea0eb860624f2529729bf06b2cf9cdf66fc11dde388f7654e825b0ff58526d73 [2022-02-20 14:26:35,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:26:35,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:26:35,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:26:35,729 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:26:35,730 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:26:35,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2022-02-20 14:26:35,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e68f8de/5c8816568ae5411d828ee38a50b3d61b/FLAG9c9b45b1d [2022-02-20 14:26:36,139 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:26:36,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2022-02-20 14:26:36,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e68f8de/5c8816568ae5411d828ee38a50b3d61b/FLAG9c9b45b1d [2022-02-20 14:26:36,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e68f8de/5c8816568ae5411d828ee38a50b3d61b [2022-02-20 14:26:36,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:26:36,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:26:36,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:36,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:26:36,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:26:36,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@831221b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36, skipping insertion in model container [2022-02-20 14:26:36,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:26:36,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:26:36,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i[805,818] [2022-02-20 14:26:36,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:36,369 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:26:36,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i[805,818] [2022-02-20 14:26:36,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:36,406 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:26:36,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36 WrapperNode [2022-02-20 14:26:36,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:36,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:36,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:26:36,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:26:36,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,442 INFO L137 Inliner]: procedures = 21, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2022-02-20 14:26:36,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:36,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:26:36,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:26:36,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:26:36,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:26:36,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:26:36,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:26:36,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:26:36,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (1/1) ... [2022-02-20 14:26:36,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:36,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:36,505 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-02-20 14:26:36,513 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-02-20 14:26:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 14:26:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:26:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:26:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:26:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 14:26:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:26:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:26:36,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:26:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:26:36,576 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:26:36,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:26:36,738 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:26:36,742 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:26:36,742 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:26:36,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:36 BoogieIcfgContainer [2022-02-20 14:26:36,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:26:36,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:26:36,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:26:36,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:26:36,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:26:36" (1/3) ... [2022-02-20 14:26:36,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706fae94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:36, skipping insertion in model container [2022-02-20 14:26:36,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:36" (2/3) ... [2022-02-20 14:26:36,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706fae94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:36, skipping insertion in model container [2022-02-20 14:26:36,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:36" (3/3) ... [2022-02-20 14:26:36,749 INFO L111 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2022-02-20 14:26:36,753 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:26:36,753 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:26:36,783 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:26:36,788 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:26:36,788 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:26:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:26:36,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:36,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:36,805 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2022-02-20 14:26:36,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:36,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712853923] [2022-02-20 14:26:36,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:36,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {23#true} is VALID [2022-02-20 14:26:36,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {23#true} is VALID [2022-02-20 14:26:36,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume !(init_~i~0#1 < init_~size#1); {23#true} is VALID [2022-02-20 14:26:36,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {23#true} is VALID [2022-02-20 14:26:36,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-02-20 14:26:36,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} main_~i~1#1 := 0; {24#false} is VALID [2022-02-20 14:26:36,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} assume !!(main_~i~1#1 < 1000000); {24#false} is VALID [2022-02-20 14:26:36,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {24#false} is VALID [2022-02-20 14:26:36,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == __VERIFIER_assert_~cond#1; {24#false} is VALID [2022-02-20 14:26:36,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 14:26:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:36,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:36,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712853923] [2022-02-20 14:26:36,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712853923] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:36,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:36,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:26:36,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839923785] [2022-02-20 14:26:36,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:37,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:26:37,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:37,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:37,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:26:37,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:37,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:26:37,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:37,050 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:37,082 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-02-20 14:26:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:26:37,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:26:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 14:26:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 14:26:37,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2022-02-20 14:26:37,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:37,165 INFO L225 Difference]: With dead ends: 36 [2022-02-20 14:26:37,174 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 14:26:37,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:37,179 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:37,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 14:26:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 14:26:37,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:37,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,227 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,228 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:37,231 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-02-20 14:26:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-02-20 14:26:37,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:37,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:37,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:26:37,233 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:26:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:37,235 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-02-20 14:26:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-02-20 14:26:37,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:37,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:37,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:37,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-02-20 14:26:37,244 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2022-02-20 14:26:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:37,260 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-20 14:26:37,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-02-20 14:26:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:26:37,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:37,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:37,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:26:37,262 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2022-02-20 14:26:37,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:37,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918313689] [2022-02-20 14:26:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:37,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {121#true} is VALID [2022-02-20 14:26:37,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {121#true} is VALID [2022-02-20 14:26:37,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {121#true} assume !(init_~i~0#1 < init_~size#1); {121#true} is VALID [2022-02-20 14:26:37,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {123#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:37,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {123#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_~i~1#1 < 1000000); {122#false} is VALID [2022-02-20 14:26:37,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {122#false} main_~i~1#1 := 0; {122#false} is VALID [2022-02-20 14:26:37,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {122#false} assume !!(main_~i~1#1 < 1000000); {122#false} is VALID [2022-02-20 14:26:37,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {122#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {122#false} is VALID [2022-02-20 14:26:37,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {122#false} assume 0 == __VERIFIER_assert_~cond#1; {122#false} is VALID [2022-02-20 14:26:37,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {122#false} assume !false; {122#false} is VALID [2022-02-20 14:26:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:37,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:37,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918313689] [2022-02-20 14:26:37,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918313689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:37,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:37,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:26:37,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841838203] [2022-02-20 14:26:37,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:37,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:26:37,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:37,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:37,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:26:37,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:26:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:26:37,354 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:37,392 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-20 14:26:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:26:37,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:26:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 14:26:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 14:26:37,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-02-20 14:26:37,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:37,424 INFO L225 Difference]: With dead ends: 34 [2022-02-20 14:26:37,424 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:26:37,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02-20 14:26:37,426 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:37,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:26:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2022-02-20 14:26:37,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:37,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,442 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,443 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:37,444 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 14:26:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 14:26:37,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:37,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:37,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 14:26:37,445 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 14:26:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:37,446 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 14:26:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 14:26:37,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:37,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:37,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:37,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-20 14:26:37,448 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-02-20 14:26:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:37,448 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-20 14:26:37,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-20 14:26:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:26:37,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:37,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:37,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:26:37,464 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1200955363, now seen corresponding path program 1 times [2022-02-20 14:26:37,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:37,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066152198] [2022-02-20 14:26:37,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:37,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:37,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {239#true} is VALID [2022-02-20 14:26:37,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {239#true} is VALID [2022-02-20 14:26:37,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume !(init_~i~0#1 < init_~size#1); {239#true} is VALID [2022-02-20 14:26:37,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {239#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {241#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:37,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {241#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {241#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:37,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#(= |ULTIMATE.start_main_~i~1#1| 0)} assume main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;main_~flag~0#1 := 1; {241#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:37,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {241#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {242#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:37,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {242#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 1000000); {240#false} is VALID [2022-02-20 14:26:37,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#false} main_~i~1#1 := 0; {240#false} is VALID [2022-02-20 14:26:37,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#false} assume !!(main_~i~1#1 < 1000000); {240#false} is VALID [2022-02-20 14:26:37,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {240#false} is VALID [2022-02-20 14:26:37,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#false} assume 0 == __VERIFIER_assert_~cond#1; {240#false} is VALID [2022-02-20 14:26:37,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-02-20 14:26:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:37,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:37,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066152198] [2022-02-20 14:26:37,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066152198] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:37,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828703593] [2022-02-20 14:26:37,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:37,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:37,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:37,520 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-02-20 14:26:37,521 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-02-20 14:26:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:37,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:26:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:37,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:37,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {239#true} is VALID [2022-02-20 14:26:37,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {239#true} is VALID [2022-02-20 14:26:37,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume !(init_~i~0#1 < init_~size#1); {239#true} is VALID [2022-02-20 14:26:37,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {239#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {239#true} is VALID [2022-02-20 14:26:37,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {239#true} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {239#true} is VALID [2022-02-20 14:26:37,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} assume main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;main_~flag~0#1 := 1; {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} is VALID [2022-02-20 14:26:37,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} is VALID [2022-02-20 14:26:37,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} assume !(main_~i~1#1 < 1000000); {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} is VALID [2022-02-20 14:26:37,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} main_~i~1#1 := 0; {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} is VALID [2022-02-20 14:26:37,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} assume !!(main_~i~1#1 < 1000000); {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} is VALID [2022-02-20 14:26:37,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {261#(<= 1 |ULTIMATE.start_main_~flag~0#1|)} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {240#false} is VALID [2022-02-20 14:26:37,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#false} assume 0 == __VERIFIER_assert_~cond#1; {240#false} is VALID [2022-02-20 14:26:37,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-02-20 14:26:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:37,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:26:37,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828703593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:37,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:26:37,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:26:37,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611720859] [2022-02-20 14:26:37,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:37,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:26:37,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:37,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:37,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:26:37,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:26:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:37,632 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:37,655 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 14:26:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:26:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:26:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-02-20 14:26:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-02-20 14:26:37,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-02-20 14:26:37,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:37,681 INFO L225 Difference]: With dead ends: 31 [2022-02-20 14:26:37,681 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 14:26:37,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:37,682 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:37,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 14:26:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 14:26:37,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:37,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,685 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,685 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:37,686 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 14:26:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 14:26:37,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:37,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:37,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 14:26:37,687 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 14:26:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:37,688 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 14:26:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 14:26:37,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:37,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:37,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:37,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 14:26:37,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2022-02-20 14:26:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:37,690 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 14:26:37,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 14:26:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:26:37,690 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:37,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:37,709 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-02-20 14:26:37,909 WARN L452 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-02-20 14:26:37,910 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 391608737, now seen corresponding path program 1 times [2022-02-20 14:26:37,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:37,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254317068] [2022-02-20 14:26:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:37,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {375#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {375#true} is VALID [2022-02-20 14:26:37,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {375#true} is VALID [2022-02-20 14:26:37,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#true} assume !(init_~i~0#1 < init_~size#1); {375#true} is VALID [2022-02-20 14:26:37,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {375#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {377#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:37,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {377#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {377#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:37,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {377#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:37,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {378#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:37,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {378#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 1000000); {376#false} is VALID [2022-02-20 14:26:37,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#false} main_~i~1#1 := 0; {376#false} is VALID [2022-02-20 14:26:37,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {376#false} assume !!(main_~i~1#1 < 1000000); {376#false} is VALID [2022-02-20 14:26:37,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {376#false} is VALID [2022-02-20 14:26:37,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#false} assume 0 == __VERIFIER_assert_~cond#1; {376#false} is VALID [2022-02-20 14:26:37,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#false} assume !false; {376#false} is VALID [2022-02-20 14:26:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:37,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:37,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254317068] [2022-02-20 14:26:37,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254317068] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:37,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266937092] [2022-02-20 14:26:37,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:37,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:37,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:37,950 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-02-20 14:26:37,951 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-02-20 14:26:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:37,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:26:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:37,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:38,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {375#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {375#true} is VALID [2022-02-20 14:26:38,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {385#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} is VALID [2022-02-20 14:26:38,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} assume !(init_~i~0#1 < init_~size#1); {376#false} is VALID [2022-02-20 14:26:38,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {376#false} assume { :end_inline_init } true;main_~i~1#1 := 0; {376#false} is VALID [2022-02-20 14:26:38,066 INFO L290 TraceCheckUtils]: 4: Hoare triple {376#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {376#false} is VALID [2022-02-20 14:26:38,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {376#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {376#false} is VALID [2022-02-20 14:26:38,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {376#false} is VALID [2022-02-20 14:26:38,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#false} assume !(main_~i~1#1 < 1000000); {376#false} is VALID [2022-02-20 14:26:38,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#false} main_~i~1#1 := 0; {376#false} is VALID [2022-02-20 14:26:38,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {376#false} assume !!(main_~i~1#1 < 1000000); {376#false} is VALID [2022-02-20 14:26:38,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {376#false} is VALID [2022-02-20 14:26:38,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#false} assume 0 == __VERIFIER_assert_~cond#1; {376#false} is VALID [2022-02-20 14:26:38,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#false} assume !false; {376#false} is VALID [2022-02-20 14:26:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:38,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:26:38,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266937092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:38,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:26:38,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:26:38,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742707427] [2022-02-20 14:26:38,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:38,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:26:38,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:38,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:38,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:26:38,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:38,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:26:38,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:38,080 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:38,115 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 14:26:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:26:38,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:26:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 14:26:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 14:26:38,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-02-20 14:26:38,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:38,142 INFO L225 Difference]: With dead ends: 32 [2022-02-20 14:26:38,142 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 14:26:38,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:38,143 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:38,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 14:26:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-20 14:26:38,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:38,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,147 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,147 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:38,148 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 14:26:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 14:26:38,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:38,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:38,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:26:38,149 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:26:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:38,150 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 14:26:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 14:26:38,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:38,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:38,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:38,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 14:26:38,151 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-02-20 14:26:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:38,151 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 14:26:38,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 14:26:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:26:38,152 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:38,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:38,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 14:26:38,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 14:26:38,368 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:38,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:38,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2022-02-20 14:26:38,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:38,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813907016] [2022-02-20 14:26:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:38,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:38,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {519#true} is VALID [2022-02-20 14:26:38,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {519#true} is VALID [2022-02-20 14:26:38,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {519#true} is VALID [2022-02-20 14:26:38,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {519#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {519#true} is VALID [2022-02-20 14:26:38,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {519#true} assume !(init_~i~0#1 < init_~size#1); {519#true} is VALID [2022-02-20 14:26:38,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {521#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:38,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {521#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {521#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:38,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {521#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:38,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {521#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {522#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:38,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {522#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 1000000); {520#false} is VALID [2022-02-20 14:26:38,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#false} main_~i~1#1 := 0; {520#false} is VALID [2022-02-20 14:26:38,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {520#false} assume !!(main_~i~1#1 < 1000000); {520#false} is VALID [2022-02-20 14:26:38,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {520#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {520#false} is VALID [2022-02-20 14:26:38,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {520#false} assume 0 == __VERIFIER_assert_~cond#1; {520#false} is VALID [2022-02-20 14:26:38,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 14:26:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:38,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:38,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813907016] [2022-02-20 14:26:38,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813907016] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:38,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902641551] [2022-02-20 14:26:38,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:38,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:38,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:38,420 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-02-20 14:26:38,421 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-02-20 14:26:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:38,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:26:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:38,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:38,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {519#true} is VALID [2022-02-20 14:26:38,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {529#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} is VALID [2022-02-20 14:26:38,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {529#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} is VALID [2022-02-20 14:26:38,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {529#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {536#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:38,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {536#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !(init_~i~0#1 < init_~size#1); {520#false} is VALID [2022-02-20 14:26:38,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {520#false} assume { :end_inline_init } true;main_~i~1#1 := 0; {520#false} is VALID [2022-02-20 14:26:38,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {520#false} is VALID [2022-02-20 14:26:38,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {520#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {520#false} is VALID [2022-02-20 14:26:38,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {520#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {520#false} is VALID [2022-02-20 14:26:38,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {520#false} assume !(main_~i~1#1 < 1000000); {520#false} is VALID [2022-02-20 14:26:38,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#false} main_~i~1#1 := 0; {520#false} is VALID [2022-02-20 14:26:38,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {520#false} assume !!(main_~i~1#1 < 1000000); {520#false} is VALID [2022-02-20 14:26:38,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {520#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {520#false} is VALID [2022-02-20 14:26:38,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {520#false} assume 0 == __VERIFIER_assert_~cond#1; {520#false} is VALID [2022-02-20 14:26:38,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 14:26:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:38,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:38,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 14:26:38,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {520#false} assume 0 == __VERIFIER_assert_~cond#1; {520#false} is VALID [2022-02-20 14:26:38,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {520#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {520#false} is VALID [2022-02-20 14:26:38,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {520#false} assume !!(main_~i~1#1 < 1000000); {520#false} is VALID [2022-02-20 14:26:38,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#false} main_~i~1#1 := 0; {520#false} is VALID [2022-02-20 14:26:38,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {520#false} assume !(main_~i~1#1 < 1000000); {520#false} is VALID [2022-02-20 14:26:38,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {520#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {520#false} is VALID [2022-02-20 14:26:38,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {520#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {520#false} is VALID [2022-02-20 14:26:38,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {520#false} is VALID [2022-02-20 14:26:38,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {520#false} assume { :end_inline_init } true;main_~i~1#1 := 0; {520#false} is VALID [2022-02-20 14:26:38,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {600#(< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|)} assume !(init_~i~0#1 < init_~size#1); {520#false} is VALID [2022-02-20 14:26:38,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {604#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {600#(< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:38,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {604#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:38,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {604#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:38,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {519#true} is VALID [2022-02-20 14:26:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:38,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902641551] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:38,687 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:38,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-02-20 14:26:38,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280511483] [2022-02-20 14:26:38,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:38,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:26:38,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:38,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:38,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:26:38,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:38,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:26:38,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:26:38,707 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:38,812 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-02-20 14:26:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:26:38,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:26:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-02-20 14:26:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-02-20 14:26:38,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-02-20 14:26:38,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:38,863 INFO L225 Difference]: With dead ends: 56 [2022-02-20 14:26:38,863 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 14:26:38,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:26:38,864 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:38,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 56 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 14:26:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-02-20 14:26:38,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:38,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,871 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,871 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:38,872 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-20 14:26:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-20 14:26:38,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:38,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:38,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 14:26:38,873 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 14:26:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:38,874 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-20 14:26:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-20 14:26:38,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:38,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:38,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:38,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-20 14:26:38,876 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 15 [2022-02-20 14:26:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:38,876 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-20 14:26:38,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 14:26:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:26:38,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:38,877 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:38,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 14:26:39,093 WARN L452 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-02-20 14:26:39,094 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:39,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 2 times [2022-02-20 14:26:39,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:39,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343003179] [2022-02-20 14:26:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:39,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {805#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {805#true} is VALID [2022-02-20 14:26:39,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {805#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {805#true} is VALID [2022-02-20 14:26:39,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {805#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {805#true} is VALID [2022-02-20 14:26:39,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {805#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {805#true} is VALID [2022-02-20 14:26:39,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {805#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {805#true} is VALID [2022-02-20 14:26:39,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {805#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {805#true} is VALID [2022-02-20 14:26:39,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {805#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {805#true} is VALID [2022-02-20 14:26:39,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {805#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {805#true} is VALID [2022-02-20 14:26:39,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {805#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {805#true} is VALID [2022-02-20 14:26:39,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {805#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {805#true} is VALID [2022-02-20 14:26:39,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#true} assume !(init_~i~0#1 < init_~size#1); {805#true} is VALID [2022-02-20 14:26:39,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {807#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:39,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {807#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {807#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:39,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {807#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {807#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:39,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {807#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {808#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:39,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {808#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:39,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {808#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {808#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:39,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {808#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {809#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:39,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {809#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_~i~1#1 < 1000000); {806#false} is VALID [2022-02-20 14:26:39,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {806#false} main_~i~1#1 := 0; {806#false} is VALID [2022-02-20 14:26:39,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {806#false} assume !!(main_~i~1#1 < 1000000); {806#false} is VALID [2022-02-20 14:26:39,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {806#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {806#false} is VALID [2022-02-20 14:26:39,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {806#false} assume 0 == __VERIFIER_assert_~cond#1; {806#false} is VALID [2022-02-20 14:26:39,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {806#false} assume !false; {806#false} is VALID [2022-02-20 14:26:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:26:39,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:39,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343003179] [2022-02-20 14:26:39,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343003179] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:39,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035378896] [2022-02-20 14:26:39,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:39,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:39,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:39,163 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-02-20 14:26:39,165 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-02-20 14:26:39,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:39,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:39,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:26:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:39,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:39,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {805#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {805#true} is VALID [2022-02-20 14:26:39,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {805#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {816#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} is VALID [2022-02-20 14:26:39,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {816#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} is VALID [2022-02-20 14:26:39,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {816#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {823#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:39,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {823#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {823#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:39,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {830#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} is VALID [2022-02-20 14:26:39,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {830#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} is VALID [2022-02-20 14:26:39,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {830#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {837#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} is VALID [2022-02-20 14:26:39,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {837#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {837#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} is VALID [2022-02-20 14:26:39,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {844#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} is VALID [2022-02-20 14:26:39,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {844#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} assume !(init_~i~0#1 < init_~size#1); {806#false} is VALID [2022-02-20 14:26:39,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {806#false} assume { :end_inline_init } true;main_~i~1#1 := 0; {806#false} is VALID [2022-02-20 14:26:39,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {806#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {806#false} is VALID [2022-02-20 14:26:39,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {806#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {806#false} is VALID [2022-02-20 14:26:39,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {806#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {806#false} is VALID [2022-02-20 14:26:39,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {806#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {806#false} is VALID [2022-02-20 14:26:39,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {806#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {806#false} is VALID [2022-02-20 14:26:39,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {806#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {806#false} is VALID [2022-02-20 14:26:39,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {806#false} assume !(main_~i~1#1 < 1000000); {806#false} is VALID [2022-02-20 14:26:39,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {806#false} main_~i~1#1 := 0; {806#false} is VALID [2022-02-20 14:26:39,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {806#false} assume !!(main_~i~1#1 < 1000000); {806#false} is VALID [2022-02-20 14:26:39,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {806#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {806#false} is VALID [2022-02-20 14:26:39,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {806#false} assume 0 == __VERIFIER_assert_~cond#1; {806#false} is VALID [2022-02-20 14:26:39,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {806#false} assume !false; {806#false} is VALID [2022-02-20 14:26:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:26:39,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:39,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {806#false} assume !false; {806#false} is VALID [2022-02-20 14:26:39,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {806#false} assume 0 == __VERIFIER_assert_~cond#1; {806#false} is VALID [2022-02-20 14:26:39,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {806#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {806#false} is VALID [2022-02-20 14:26:39,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {806#false} assume !!(main_~i~1#1 < 1000000); {806#false} is VALID [2022-02-20 14:26:39,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {806#false} main_~i~1#1 := 0; {806#false} is VALID [2022-02-20 14:26:39,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {806#false} assume !(main_~i~1#1 < 1000000); {806#false} is VALID [2022-02-20 14:26:39,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {806#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {806#false} is VALID [2022-02-20 14:26:39,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {806#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {806#false} is VALID [2022-02-20 14:26:39,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {806#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {806#false} is VALID [2022-02-20 14:26:39,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {806#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {806#false} is VALID [2022-02-20 14:26:39,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {806#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {806#false} is VALID [2022-02-20 14:26:39,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {806#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {806#false} is VALID [2022-02-20 14:26:39,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {806#false} assume { :end_inline_init } true;main_~i~1#1 := 0; {806#false} is VALID [2022-02-20 14:26:39,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {926#(< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|)} assume !(init_~i~0#1 < init_~size#1); {806#false} is VALID [2022-02-20 14:26:39,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {926#(< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:39,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {930#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:39,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {937#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {930#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:39,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {937#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {937#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:39,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {944#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {937#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:39,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {944#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {944#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:39,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {951#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {944#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:39,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {951#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {951#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:39,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {805#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {951#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:39,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {805#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {805#true} is VALID [2022-02-20 14:26:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:26:39,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035378896] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:39,553 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:39,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2022-02-20 14:26:39,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210482626] [2022-02-20 14:26:39,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:39,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 14:26:39,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:39,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:39,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:39,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:26:39,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:39,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:26:39,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:26:39,584 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:39,741 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-02-20 14:26:39,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 14:26:39,742 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 14:26:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-02-20 14:26:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-02-20 14:26:39,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 92 transitions. [2022-02-20 14:26:39,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:39,817 INFO L225 Difference]: With dead ends: 81 [2022-02-20 14:26:39,817 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 14:26:39,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:26:39,818 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:39,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 54 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 14:26:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 42. [2022-02-20 14:26:39,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:39,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:39,833 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:39,833 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:39,834 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-02-20 14:26:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-02-20 14:26:39,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:39,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:39,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 65 states. [2022-02-20 14:26:39,835 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 65 states. [2022-02-20 14:26:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:39,837 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-02-20 14:26:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-02-20 14:26:39,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:39,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:39,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:39,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-02-20 14:26:39,839 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 24 [2022-02-20 14:26:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:39,839 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-02-20 14:26:39,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-02-20 14:26:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:26:39,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:39,840 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:39,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:40,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:40,057 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1130748941, now seen corresponding path program 3 times [2022-02-20 14:26:40,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:40,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614501912] [2022-02-20 14:26:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:40,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {1252#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {1252#true} is VALID [2022-02-20 14:26:40,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {1252#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {1252#true} is VALID [2022-02-20 14:26:40,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {1252#true} assume !(init_~i~0#1 < init_~size#1); {1252#true} is VALID [2022-02-20 14:26:40,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {1252#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {1254#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:40,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {1254#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1254#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:40,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {1254#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1254#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:40,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {1254#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1255#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:40,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {1255#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1255#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:40,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {1255#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1255#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:40,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {1255#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1256#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:40,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {1256#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1256#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:40,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {1256#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1256#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:40,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {1256#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1257#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:40,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {1257#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !(main_~i~1#1 < 1000000); {1253#false} is VALID [2022-02-20 14:26:40,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {1253#false} main_~i~1#1 := 0; {1253#false} is VALID [2022-02-20 14:26:40,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {1253#false} assume !!(main_~i~1#1 < 1000000); {1253#false} is VALID [2022-02-20 14:26:40,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {1253#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1253#false} is VALID [2022-02-20 14:26:40,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {1253#false} assume 0 == __VERIFIER_assert_~cond#1; {1253#false} is VALID [2022-02-20 14:26:40,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {1253#false} assume !false; {1253#false} is VALID [2022-02-20 14:26:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-20 14:26:40,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:40,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614501912] [2022-02-20 14:26:40,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614501912] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:40,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883866833] [2022-02-20 14:26:40,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:26:40,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:40,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:40,178 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:40,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:26:40,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:26:40,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:40,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 14:26:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:40,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:40,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {1252#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {1252#true} is VALID [2022-02-20 14:26:40,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {1252#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume !(init_~i~0#1 < init_~size#1); {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} is VALID [2022-02-20 14:26:40,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {1264#(= |ULTIMATE.start_main_~#a~0#1.offset| 0)} assume { :end_inline_init } true;main_~i~1#1 := 0; {1331#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {1331#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1335#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {1335#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~i~1#1 < 1000000); {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {1339#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_~i~1#1 := 0; {1367#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {1367#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~1#1 < 1000000); {1367#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:40,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {1367#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1374#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:40,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {1374#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1253#false} is VALID [2022-02-20 14:26:40,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {1253#false} assume !false; {1253#false} is VALID [2022-02-20 14:26:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-02-20 14:26:40,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:40,749 INFO L356 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-02-20 14:26:40,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2022-02-20 14:26:40,760 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 14:26:40,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-02-20 14:26:40,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {1253#false} assume !false; {1253#false} is VALID [2022-02-20 14:26:40,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {1374#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1253#false} is VALID [2022-02-20 14:26:40,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {1387#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0))} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1374#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:40,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {1387#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0))} assume !!(main_~i~1#1 < 1000000); {1387#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0))} is VALID [2022-02-20 14:26:40,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} main_~i~1#1 := 0; {1387#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0))} is VALID [2022-02-20 14:26:40,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} assume !(main_~i~1#1 < 1000000); {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} is VALID [2022-02-20 14:26:40,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} is VALID [2022-02-20 14:26:40,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} is VALID [2022-02-20 14:26:40,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} is VALID [2022-02-20 14:26:40,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} is VALID [2022-02-20 14:26:40,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} is VALID [2022-02-20 14:26:40,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} is VALID [2022-02-20 14:26:40,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} is VALID [2022-02-20 14:26:40,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {1422#(or (not (= |ULTIMATE.start_main_#t~mem4#1.base| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_#t~mem4#1.offset| 0)))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1394#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0))} is VALID [2022-02-20 14:26:40,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {1254#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1422#(or (not (= |ULTIMATE.start_main_#t~mem4#1.base| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_#t~mem4#1.offset| 0)))} is VALID [2022-02-20 14:26:40,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {1252#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {1254#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:40,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {1252#true} assume !(init_~i~0#1 < init_~size#1); {1252#true} is VALID [2022-02-20 14:26:40,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {1252#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1252#true} is VALID [2022-02-20 14:26:40,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {1252#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1252#true} is VALID [2022-02-20 14:26:40,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {1252#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {1252#true} is VALID [2022-02-20 14:26:40,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {1252#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {1252#true} is VALID [2022-02-20 14:26:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-02-20 14:26:40,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883866833] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:40,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:40,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 15 [2022-02-20 14:26:40,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906542932] [2022-02-20 14:26:40,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:26:40,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:40,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:40,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:40,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:26:40,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:26:40,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:26:40,831 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:41,178 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-02-20 14:26:41,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 14:26:41,178 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 14:26:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-02-20 14:26:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-02-20 14:26:41,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 89 transitions. [2022-02-20 14:26:41,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:41,245 INFO L225 Difference]: With dead ends: 94 [2022-02-20 14:26:41,245 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 14:26:41,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2022-02-20 14:26:41,246 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 125 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:41,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 91 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 14:26:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2022-02-20 14:26:41,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:41,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,261 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,261 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:41,263 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-02-20 14:26:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2022-02-20 14:26:41,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:41,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:41,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 86 states. [2022-02-20 14:26:41,264 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 86 states. [2022-02-20 14:26:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:41,265 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-02-20 14:26:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2022-02-20 14:26:41,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:41,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:41,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:41,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-02-20 14:26:41,267 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 39 [2022-02-20 14:26:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:41,268 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-02-20 14:26:41,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-02-20 14:26:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 14:26:41,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:41,269 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:41,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:41,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:41,485 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash 927320518, now seen corresponding path program 1 times [2022-02-20 14:26:41,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:41,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854419463] [2022-02-20 14:26:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:41,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {1873#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {1873#true} is VALID [2022-02-20 14:26:41,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {1873#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !(init_~i~0#1 < init_~size#1); {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume { :end_inline_init } true;main_~i~1#1 := 0; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !(main_~i~1#1 < 1000000); {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} main_~i~1#1 := 0; {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !!(main_~i~1#1 < 1000000); {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} is VALID [2022-02-20 14:26:41,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {1875#(= |ULTIMATE.start_main_~flag~0#1| 0)} assume !(0 == main_~flag~0#1); {1874#false} is VALID [2022-02-20 14:26:41,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {1874#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1874#false} is VALID [2022-02-20 14:26:41,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {1874#false} assume !!(main_~i~1#1 < 1000000); {1874#false} is VALID [2022-02-20 14:26:41,584 INFO L290 TraceCheckUtils]: 42: Hoare triple {1874#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1874#false} is VALID [2022-02-20 14:26:41,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {1874#false} assume 0 == __VERIFIER_assert_~cond#1; {1874#false} is VALID [2022-02-20 14:26:41,584 INFO L290 TraceCheckUtils]: 44: Hoare triple {1874#false} assume !false; {1874#false} is VALID [2022-02-20 14:26:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-02-20 14:26:41,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:41,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854419463] [2022-02-20 14:26:41,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854419463] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:41,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:41,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:26:41,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112185602] [2022-02-20 14:26:41,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:41,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:26:41,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:41,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:41,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:26:41,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:26:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:26:41,596 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:41,617 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-02-20 14:26:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:26:41,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:26:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 14:26:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 14:26:41,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-02-20 14:26:41,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:41,643 INFO L225 Difference]: With dead ends: 55 [2022-02-20 14:26:41,643 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 14:26:41,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02-20 14:26:41,644 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:41,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 14:26:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 14:26:41,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:41,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,658 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,662 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:41,664 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-20 14:26:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-20 14:26:41,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:41,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:41,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 14:26:41,664 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 14:26:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:41,665 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-20 14:26:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-20 14:26:41,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:41,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:41,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:41,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-02-20 14:26:41,668 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2022-02-20 14:26:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:41,669 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-02-20 14:26:41,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-02-20 14:26:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 14:26:41,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:41,671 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:41,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:26:41,671 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:41,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2012771472, now seen corresponding path program 1 times [2022-02-20 14:26:41,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:41,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982283625] [2022-02-20 14:26:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:41,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {2114#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {2114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {2114#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {2114#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2114#true} is VALID [2022-02-20 14:26:41,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {2114#true} assume !(init_~i~0#1 < init_~size#1); {2114#true} is VALID [2022-02-20 14:26:41,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {2114#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {2116#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:41,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {2116#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2116#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:41,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {2116#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2116#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:41,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {2116#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2117#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:41,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {2117#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2117#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:41,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {2117#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2117#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:41,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {2117#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2118#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:41,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {2118#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2118#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:41,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {2118#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2118#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:41,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {2118#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2119#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:41,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {2119#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2119#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:41,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {2119#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2119#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:41,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {2119#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2120#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:26:41,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {2120#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !(main_~i~1#1 < 1000000); {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {2115#false} main_~i~1#1 := 0; {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000); {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {2115#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {2115#false} assume !(0 == __VERIFIER_assert_~cond#1); {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {2115#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {2115#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000); {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {2115#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {2115#false} assume 0 == __VERIFIER_assert_~cond#1; {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {2115#false} assume !false; {2115#false} is VALID [2022-02-20 14:26:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-02-20 14:26:41,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:41,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982283625] [2022-02-20 14:26:41,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982283625] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:41,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723925193] [2022-02-20 14:26:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:41,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:41,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:41,799 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:41,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 14:26:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:41,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 14:26:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:41,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:42,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {2114#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2114#true} is VALID [2022-02-20 14:26:42,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {2114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {2127#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} is VALID [2022-02-20 14:26:42,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {2127#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2127#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} is VALID [2022-02-20 14:26:42,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {2127#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2134#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:42,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {2134#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2134#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:42,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {2134#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2141#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} is VALID [2022-02-20 14:26:42,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {2141#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2141#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} is VALID [2022-02-20 14:26:42,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {2141#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2148#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} is VALID [2022-02-20 14:26:42,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {2148#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2148#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} is VALID [2022-02-20 14:26:42,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {2148#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2155#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} is VALID [2022-02-20 14:26:42,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {2155#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2155#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} is VALID [2022-02-20 14:26:42,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {2155#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2162#(and (<= |ULTIMATE.start_init_~i~0#1| 5) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:42,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#(and (<= |ULTIMATE.start_init_~i~0#1| 5) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2162#(and (<= |ULTIMATE.start_init_~i~0#1| 5) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:42,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#(and (<= |ULTIMATE.start_init_~i~0#1| 5) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2169#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 6))} is VALID [2022-02-20 14:26:42,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {2169#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 6))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2169#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 6))} is VALID [2022-02-20 14:26:42,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {2169#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 6))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2176#(and (<= |ULTIMATE.start_init_~i~0#1| 7) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:42,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {2176#(and (<= |ULTIMATE.start_init_~i~0#1| 7) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2176#(and (<= |ULTIMATE.start_init_~i~0#1| 7) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:42,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {2176#(and (<= |ULTIMATE.start_init_~i~0#1| 7) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2183#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 8))} is VALID [2022-02-20 14:26:42,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {2183#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 8))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2183#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 8))} is VALID [2022-02-20 14:26:42,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {2183#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 8))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2190#(and (<= |ULTIMATE.start_init_~i~0#1| 9) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:42,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {2190#(and (<= |ULTIMATE.start_init_~i~0#1| 9) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2190#(and (<= |ULTIMATE.start_init_~i~0#1| 9) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:42,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {2190#(and (<= |ULTIMATE.start_init_~i~0#1| 9) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2197#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 10))} is VALID [2022-02-20 14:26:42,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 10))} assume !(init_~i~0#1 < init_~size#1); {2115#false} is VALID [2022-02-20 14:26:42,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {2115#false} assume { :end_inline_init } true;main_~i~1#1 := 0; {2115#false} is VALID [2022-02-20 14:26:42,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2115#false} is VALID [2022-02-20 14:26:42,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {2115#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {2115#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2115#false} is VALID [2022-02-20 14:26:42,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2115#false} is VALID [2022-02-20 14:26:42,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {2115#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {2115#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2115#false} is VALID [2022-02-20 14:26:42,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2115#false} is VALID [2022-02-20 14:26:42,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {2115#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {2115#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2115#false} is VALID [2022-02-20 14:26:42,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2115#false} is VALID [2022-02-20 14:26:42,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {2115#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {2115#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2115#false} is VALID [2022-02-20 14:26:42,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {2115#false} assume !(main_~i~1#1 < 1000000); {2115#false} is VALID [2022-02-20 14:26:42,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {2115#false} main_~i~1#1 := 0; {2115#false} is VALID [2022-02-20 14:26:42,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000); {2115#false} is VALID [2022-02-20 14:26:42,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {2115#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2115#false} is VALID [2022-02-20 14:26:42,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {2115#false} assume !(0 == __VERIFIER_assert_~cond#1); {2115#false} is VALID [2022-02-20 14:26:42,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {2115#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {2115#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2115#false} is VALID [2022-02-20 14:26:42,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000); {2115#false} is VALID [2022-02-20 14:26:42,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {2115#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2115#false} is VALID [2022-02-20 14:26:42,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {2115#false} assume 0 == __VERIFIER_assert_~cond#1; {2115#false} is VALID [2022-02-20 14:26:42,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {2115#false} assume !false; {2115#false} is VALID [2022-02-20 14:26:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 14:26:42,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:42,668 INFO L290 TraceCheckUtils]: 46: Hoare triple {2115#false} assume !false; {2115#false} is VALID [2022-02-20 14:26:42,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {2115#false} assume 0 == __VERIFIER_assert_~cond#1; {2115#false} is VALID [2022-02-20 14:26:42,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {2115#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2115#false} is VALID [2022-02-20 14:26:42,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000); {2115#false} is VALID [2022-02-20 14:26:42,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {2115#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2115#false} is VALID [2022-02-20 14:26:42,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {2115#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {2115#false} assume !(0 == __VERIFIER_assert_~cond#1); {2115#false} is VALID [2022-02-20 14:26:42,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {2115#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2115#false} is VALID [2022-02-20 14:26:42,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000); {2115#false} is VALID [2022-02-20 14:26:42,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {2115#false} main_~i~1#1 := 0; {2115#false} is VALID [2022-02-20 14:26:42,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {2115#false} assume !(main_~i~1#1 < 1000000); {2115#false} is VALID [2022-02-20 14:26:42,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {2115#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2115#false} is VALID [2022-02-20 14:26:42,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {2115#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2115#false} is VALID [2022-02-20 14:26:42,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {2115#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2115#false} is VALID [2022-02-20 14:26:42,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {2115#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2115#false} is VALID [2022-02-20 14:26:42,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {2115#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2115#false} is VALID [2022-02-20 14:26:42,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {2115#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2115#false} is VALID [2022-02-20 14:26:42,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {2115#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2115#false} is VALID [2022-02-20 14:26:42,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {2115#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2115#false} is VALID [2022-02-20 14:26:42,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {2115#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2115#false} is VALID [2022-02-20 14:26:42,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {2115#false} assume { :end_inline_init } true;main_~i~1#1 := 0; {2115#false} is VALID [2022-02-20 14:26:42,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {2345#(< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|)} assume !(init_~i~0#1 < init_~size#1); {2115#false} is VALID [2022-02-20 14:26:42,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {2349#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2345#(< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {2349#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2349#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {2356#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2349#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {2356#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2356#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {2363#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2356#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {2363#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2363#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {2370#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2363#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {2370#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2370#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {2377#(< (+ |ULTIMATE.start_init_~i~0#1| 5) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2370#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {2377#(< (+ |ULTIMATE.start_init_~i~0#1| 5) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2377#(< (+ |ULTIMATE.start_init_~i~0#1| 5) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {2384#(< (+ |ULTIMATE.start_init_~i~0#1| 6) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2377#(< (+ |ULTIMATE.start_init_~i~0#1| 5) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {2384#(< (+ |ULTIMATE.start_init_~i~0#1| 6) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2384#(< (+ |ULTIMATE.start_init_~i~0#1| 6) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {2391#(< (+ |ULTIMATE.start_init_~i~0#1| 7) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2384#(< (+ |ULTIMATE.start_init_~i~0#1| 6) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {2391#(< (+ |ULTIMATE.start_init_~i~0#1| 7) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2391#(< (+ |ULTIMATE.start_init_~i~0#1| 7) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#(< (+ |ULTIMATE.start_init_~i~0#1| 8) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2391#(< (+ |ULTIMATE.start_init_~i~0#1| 7) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {2398#(< (+ |ULTIMATE.start_init_~i~0#1| 8) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2398#(< (+ |ULTIMATE.start_init_~i~0#1| 8) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#(< (+ |ULTIMATE.start_init_~i~0#1| 9) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2398#(< (+ |ULTIMATE.start_init_~i~0#1| 8) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {2405#(< (+ |ULTIMATE.start_init_~i~0#1| 9) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2405#(< (+ |ULTIMATE.start_init_~i~0#1| 9) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {2412#(< (+ |ULTIMATE.start_init_~i~0#1| 10) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2405#(< (+ |ULTIMATE.start_init_~i~0#1| 9) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {2412#(< (+ |ULTIMATE.start_init_~i~0#1| 10) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2412#(< (+ |ULTIMATE.start_init_~i~0#1| 10) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {2114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {2412#(< (+ |ULTIMATE.start_init_~i~0#1| 10) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:42,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {2114#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2114#true} is VALID [2022-02-20 14:26:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 14:26:42,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723925193] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:42,682 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:42,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2022-02-20 14:26:42,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941819722] [2022-02-20 14:26:42,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:42,683 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 14:26:42,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:42,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:42,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:42,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-20 14:26:42,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:42,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-20 14:26:42,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=516, Unknown=0, NotChecked=0, Total=812 [2022-02-20 14:26:42,740 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:42,996 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-02-20 14:26:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-20 14:26:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 14:26:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 135 transitions. [2022-02-20 14:26:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 135 transitions. [2022-02-20 14:26:43,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 135 transitions. [2022-02-20 14:26:43,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:43,085 INFO L225 Difference]: With dead ends: 132 [2022-02-20 14:26:43,085 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 14:26:43,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=516, Unknown=0, NotChecked=0, Total=812 [2022-02-20 14:26:43,086 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 82 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:43,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 74 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 14:26:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2022-02-20 14:26:43,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:43,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 75 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:43,115 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 75 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:43,116 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 75 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:43,118 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2022-02-20 14:26:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2022-02-20 14:26:43,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:43,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:43,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 107 states. [2022-02-20 14:26:43,119 INFO L87 Difference]: Start difference. First operand has 75 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 107 states. [2022-02-20 14:26:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:43,121 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2022-02-20 14:26:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2022-02-20 14:26:43,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:43,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:43,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:43,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-02-20 14:26:43,123 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 47 [2022-02-20 14:26:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:43,123 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-02-20 14:26:43,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-02-20 14:26:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 14:26:43,124 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:43,124 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:43,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:43,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:43,344 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:43,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash 426637324, now seen corresponding path program 2 times [2022-02-20 14:26:43,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:43,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268940965] [2022-02-20 14:26:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:43,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {2915#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2915#true} is VALID [2022-02-20 14:26:43,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {2915#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {2915#true} is VALID [2022-02-20 14:26:43,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {2915#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2915#true} is VALID [2022-02-20 14:26:43,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {2915#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2915#true} is VALID [2022-02-20 14:26:43,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {2915#true} assume !(init_~i~0#1 < init_~size#1); {2915#true} is VALID [2022-02-20 14:26:43,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {2915#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {2917#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:43,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {2917#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2917#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:43,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {2917#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2917#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:43,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {2917#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2918#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:43,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {2918#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2918#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:43,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {2918#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2918#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:43,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {2918#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2919#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:43,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {2919#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2919#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:43,472 INFO L290 TraceCheckUtils]: 55: Hoare triple {2919#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2919#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:43,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {2919#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2920#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:43,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {2920#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2920#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:43,473 INFO L290 TraceCheckUtils]: 58: Hoare triple {2920#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2920#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:43,473 INFO L290 TraceCheckUtils]: 59: Hoare triple {2920#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2921#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:26:43,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {2921#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2921#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:26:43,474 INFO L290 TraceCheckUtils]: 61: Hoare triple {2921#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2921#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:26:43,474 INFO L290 TraceCheckUtils]: 62: Hoare triple {2921#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2922#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:26:43,474 INFO L290 TraceCheckUtils]: 63: Hoare triple {2922#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !(main_~i~1#1 < 1000000); {2916#false} is VALID [2022-02-20 14:26:43,474 INFO L290 TraceCheckUtils]: 64: Hoare triple {2916#false} main_~i~1#1 := 0; {2916#false} is VALID [2022-02-20 14:26:43,475 INFO L290 TraceCheckUtils]: 65: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000); {2916#false} is VALID [2022-02-20 14:26:43,475 INFO L290 TraceCheckUtils]: 66: Hoare triple {2916#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2916#false} is VALID [2022-02-20 14:26:43,475 INFO L290 TraceCheckUtils]: 67: Hoare triple {2916#false} assume !(0 == __VERIFIER_assert_~cond#1); {2916#false} is VALID [2022-02-20 14:26:43,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {2916#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {2916#false} is VALID [2022-02-20 14:26:43,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {2916#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2916#false} is VALID [2022-02-20 14:26:43,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000); {2916#false} is VALID [2022-02-20 14:26:43,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {2916#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2916#false} is VALID [2022-02-20 14:26:43,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {2916#false} assume 0 == __VERIFIER_assert_~cond#1; {2916#false} is VALID [2022-02-20 14:26:43,476 INFO L290 TraceCheckUtils]: 73: Hoare triple {2916#false} assume !false; {2916#false} is VALID [2022-02-20 14:26:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2022-02-20 14:26:43,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:43,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268940965] [2022-02-20 14:26:43,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268940965] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:43,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625450827] [2022-02-20 14:26:43,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:43,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:43,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:43,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:43,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 14:26:43,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:43,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:43,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 14:26:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:43,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:44,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {2915#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2915#true} is VALID [2022-02-20 14:26:44,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {2915#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {2929#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} is VALID [2022-02-20 14:26:44,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {2929#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2929#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} is VALID [2022-02-20 14:26:44,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {2929#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 0))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2936#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {2936#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2936#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {2936#(and (<= |ULTIMATE.start_init_~i~0#1| 1) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2943#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} is VALID [2022-02-20 14:26:44,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {2943#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2943#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} is VALID [2022-02-20 14:26:44,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {2943#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 2))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2950#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} is VALID [2022-02-20 14:26:44,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2950#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} is VALID [2022-02-20 14:26:44,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 3))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2957#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} is VALID [2022-02-20 14:26:44,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {2957#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2957#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} is VALID [2022-02-20 14:26:44,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {2957#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 4))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2964#(and (<= |ULTIMATE.start_init_~i~0#1| 5) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {2964#(and (<= |ULTIMATE.start_init_~i~0#1| 5) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2964#(and (<= |ULTIMATE.start_init_~i~0#1| 5) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {2964#(and (<= |ULTIMATE.start_init_~i~0#1| 5) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2971#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 6))} is VALID [2022-02-20 14:26:44,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {2971#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 6))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2971#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 6))} is VALID [2022-02-20 14:26:44,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {2971#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 6))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2978#(and (<= |ULTIMATE.start_init_~i~0#1| 7) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {2978#(and (<= |ULTIMATE.start_init_~i~0#1| 7) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2978#(and (<= |ULTIMATE.start_init_~i~0#1| 7) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {2978#(and (<= |ULTIMATE.start_init_~i~0#1| 7) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2985#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 8))} is VALID [2022-02-20 14:26:44,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {2985#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 8))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2985#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 8))} is VALID [2022-02-20 14:26:44,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {2985#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 8))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2992#(and (<= |ULTIMATE.start_init_~i~0#1| 9) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(and (<= |ULTIMATE.start_init_~i~0#1| 9) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2992#(and (<= |ULTIMATE.start_init_~i~0#1| 9) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {2992#(and (<= |ULTIMATE.start_init_~i~0#1| 9) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {2999#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 10))} is VALID [2022-02-20 14:26:44,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {2999#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 10))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {2999#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 10))} is VALID [2022-02-20 14:26:44,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {2999#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 10))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3006#(and (<= |ULTIMATE.start_init_~i~0#1| 11) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {3006#(and (<= |ULTIMATE.start_init_~i~0#1| 11) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3006#(and (<= |ULTIMATE.start_init_~i~0#1| 11) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {3006#(and (<= |ULTIMATE.start_init_~i~0#1| 11) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3013#(and (<= |ULTIMATE.start_init_~i~0#1| 12) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {3013#(and (<= |ULTIMATE.start_init_~i~0#1| 12) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3013#(and (<= |ULTIMATE.start_init_~i~0#1| 12) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {3013#(and (<= |ULTIMATE.start_init_~i~0#1| 12) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3020#(and (<= |ULTIMATE.start_init_~i~0#1| 13) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {3020#(and (<= |ULTIMATE.start_init_~i~0#1| 13) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3020#(and (<= |ULTIMATE.start_init_~i~0#1| 13) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {3020#(and (<= |ULTIMATE.start_init_~i~0#1| 13) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3027#(and (<= |ULTIMATE.start_init_~i~0#1| 14) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {3027#(and (<= |ULTIMATE.start_init_~i~0#1| 14) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3027#(and (<= |ULTIMATE.start_init_~i~0#1| 14) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {3027#(and (<= |ULTIMATE.start_init_~i~0#1| 14) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3034#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 15))} is VALID [2022-02-20 14:26:44,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {3034#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 15))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3034#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 15))} is VALID [2022-02-20 14:26:44,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {3034#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 15))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3041#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 16))} is VALID [2022-02-20 14:26:44,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {3041#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 16))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3041#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 16))} is VALID [2022-02-20 14:26:44,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {3041#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 16))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3048#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 17))} is VALID [2022-02-20 14:26:44,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {3048#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 17))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3048#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 17))} is VALID [2022-02-20 14:26:44,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {3048#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 17))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3055#(and (<= |ULTIMATE.start_init_~i~0#1| 18) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {3055#(and (<= |ULTIMATE.start_init_~i~0#1| 18) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3055#(and (<= |ULTIMATE.start_init_~i~0#1| 18) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {3055#(and (<= |ULTIMATE.start_init_~i~0#1| 18) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3062#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 19))} is VALID [2022-02-20 14:26:44,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {3062#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 19))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3062#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 19))} is VALID [2022-02-20 14:26:44,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {3062#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 19))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3069#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 20))} is VALID [2022-02-20 14:26:44,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {3069#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 20))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3069#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 20))} is VALID [2022-02-20 14:26:44,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {3069#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 20))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3076#(and (<= |ULTIMATE.start_init_~i~0#1| 21) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {3076#(and (<= |ULTIMATE.start_init_~i~0#1| 21) (<= 1000000 |ULTIMATE.start_init_~size#1|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3076#(and (<= |ULTIMATE.start_init_~i~0#1| 21) (<= 1000000 |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:44,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {3076#(and (<= |ULTIMATE.start_init_~i~0#1| 21) (<= 1000000 |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3083#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 22))} is VALID [2022-02-20 14:26:44,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {3083#(and (<= 1000000 |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| 22))} assume !(init_~i~0#1 < init_~size#1); {2916#false} is VALID [2022-02-20 14:26:44,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {2916#false} assume { :end_inline_init } true;main_~i~1#1 := 0; {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 54: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 55: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 60: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:44,568 INFO L290 TraceCheckUtils]: 61: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:44,569 INFO L290 TraceCheckUtils]: 62: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:44,569 INFO L290 TraceCheckUtils]: 63: Hoare triple {2916#false} assume !(main_~i~1#1 < 1000000); {2916#false} is VALID [2022-02-20 14:26:44,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {2916#false} main_~i~1#1 := 0; {2916#false} is VALID [2022-02-20 14:26:44,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000); {2916#false} is VALID [2022-02-20 14:26:44,569 INFO L290 TraceCheckUtils]: 66: Hoare triple {2916#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2916#false} is VALID [2022-02-20 14:26:44,569 INFO L290 TraceCheckUtils]: 67: Hoare triple {2916#false} assume !(0 == __VERIFIER_assert_~cond#1); {2916#false} is VALID [2022-02-20 14:26:44,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {2916#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {2916#false} is VALID [2022-02-20 14:26:44,570 INFO L290 TraceCheckUtils]: 69: Hoare triple {2916#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2916#false} is VALID [2022-02-20 14:26:44,570 INFO L290 TraceCheckUtils]: 70: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000); {2916#false} is VALID [2022-02-20 14:26:44,570 INFO L290 TraceCheckUtils]: 71: Hoare triple {2916#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2916#false} is VALID [2022-02-20 14:26:44,570 INFO L290 TraceCheckUtils]: 72: Hoare triple {2916#false} assume 0 == __VERIFIER_assert_~cond#1; {2916#false} is VALID [2022-02-20 14:26:44,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {2916#false} assume !false; {2916#false} is VALID [2022-02-20 14:26:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-02-20 14:26:44,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:45,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {2916#false} assume !false; {2916#false} is VALID [2022-02-20 14:26:45,554 INFO L290 TraceCheckUtils]: 72: Hoare triple {2916#false} assume 0 == __VERIFIER_assert_~cond#1; {2916#false} is VALID [2022-02-20 14:26:45,554 INFO L290 TraceCheckUtils]: 71: Hoare triple {2916#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2916#false} is VALID [2022-02-20 14:26:45,554 INFO L290 TraceCheckUtils]: 70: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000); {2916#false} is VALID [2022-02-20 14:26:45,554 INFO L290 TraceCheckUtils]: 69: Hoare triple {2916#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2916#false} is VALID [2022-02-20 14:26:45,554 INFO L290 TraceCheckUtils]: 68: Hoare triple {2916#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {2916#false} is VALID [2022-02-20 14:26:45,554 INFO L290 TraceCheckUtils]: 67: Hoare triple {2916#false} assume !(0 == __VERIFIER_assert_~cond#1); {2916#false} is VALID [2022-02-20 14:26:45,554 INFO L290 TraceCheckUtils]: 66: Hoare triple {2916#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2916#false} is VALID [2022-02-20 14:26:45,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000); {2916#false} is VALID [2022-02-20 14:26:45,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {2916#false} main_~i~1#1 := 0; {2916#false} is VALID [2022-02-20 14:26:45,557 INFO L290 TraceCheckUtils]: 63: Hoare triple {2916#false} assume !(main_~i~1#1 < 1000000); {2916#false} is VALID [2022-02-20 14:26:45,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 54: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 51: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {2916#false} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {2916#false} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {2916#false} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {2916#false} is VALID [2022-02-20 14:26:45,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {2916#false} assume { :end_inline_init } true;main_~i~1#1 := 0; {2916#false} is VALID [2022-02-20 14:26:45,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {3249#(< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|)} assume !(init_~i~0#1 < init_~size#1); {2916#false} is VALID [2022-02-20 14:26:45,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {3253#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3249#(< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {3253#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3253#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {3260#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3253#(< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {3260#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3260#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {3267#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3260#(< (+ |ULTIMATE.start_init_~i~0#1| 2) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {3267#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3267#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {3274#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3267#(< (+ |ULTIMATE.start_init_~i~0#1| 3) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {3274#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3274#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {3281#(< (+ |ULTIMATE.start_init_~i~0#1| 5) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3274#(< (+ |ULTIMATE.start_init_~i~0#1| 4) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {3281#(< (+ |ULTIMATE.start_init_~i~0#1| 5) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3281#(< (+ |ULTIMATE.start_init_~i~0#1| 5) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {3288#(< (+ |ULTIMATE.start_init_~i~0#1| 6) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3281#(< (+ |ULTIMATE.start_init_~i~0#1| 5) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {3288#(< (+ |ULTIMATE.start_init_~i~0#1| 6) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3288#(< (+ |ULTIMATE.start_init_~i~0#1| 6) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {3295#(< (+ |ULTIMATE.start_init_~i~0#1| 7) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3288#(< (+ |ULTIMATE.start_init_~i~0#1| 6) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {3295#(< (+ |ULTIMATE.start_init_~i~0#1| 7) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3295#(< (+ |ULTIMATE.start_init_~i~0#1| 7) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {3302#(< (+ |ULTIMATE.start_init_~i~0#1| 8) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3295#(< (+ |ULTIMATE.start_init_~i~0#1| 7) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {3302#(< (+ |ULTIMATE.start_init_~i~0#1| 8) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3302#(< (+ |ULTIMATE.start_init_~i~0#1| 8) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {3309#(< (+ |ULTIMATE.start_init_~i~0#1| 9) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3302#(< (+ |ULTIMATE.start_init_~i~0#1| 8) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {3309#(< (+ |ULTIMATE.start_init_~i~0#1| 9) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3309#(< (+ |ULTIMATE.start_init_~i~0#1| 9) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {3316#(< (+ |ULTIMATE.start_init_~i~0#1| 10) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3309#(< (+ |ULTIMATE.start_init_~i~0#1| 9) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {3316#(< (+ |ULTIMATE.start_init_~i~0#1| 10) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3316#(< (+ |ULTIMATE.start_init_~i~0#1| 10) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {3323#(< (+ |ULTIMATE.start_init_~i~0#1| 11) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3316#(< (+ |ULTIMATE.start_init_~i~0#1| 10) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {3323#(< (+ |ULTIMATE.start_init_~i~0#1| 11) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3323#(< (+ |ULTIMATE.start_init_~i~0#1| 11) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {3330#(< (+ |ULTIMATE.start_init_~i~0#1| 12) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3323#(< (+ |ULTIMATE.start_init_~i~0#1| 11) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {3330#(< (+ |ULTIMATE.start_init_~i~0#1| 12) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3330#(< (+ |ULTIMATE.start_init_~i~0#1| 12) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {3337#(< (+ |ULTIMATE.start_init_~i~0#1| 13) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3330#(< (+ |ULTIMATE.start_init_~i~0#1| 12) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {3337#(< (+ |ULTIMATE.start_init_~i~0#1| 13) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3337#(< (+ |ULTIMATE.start_init_~i~0#1| 13) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {3344#(< (+ |ULTIMATE.start_init_~i~0#1| 14) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3337#(< (+ |ULTIMATE.start_init_~i~0#1| 13) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {3344#(< (+ |ULTIMATE.start_init_~i~0#1| 14) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3344#(< (+ |ULTIMATE.start_init_~i~0#1| 14) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {3351#(< (+ |ULTIMATE.start_init_~i~0#1| 15) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3344#(< (+ |ULTIMATE.start_init_~i~0#1| 14) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {3351#(< (+ |ULTIMATE.start_init_~i~0#1| 15) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3351#(< (+ |ULTIMATE.start_init_~i~0#1| 15) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {3358#(< (+ |ULTIMATE.start_init_~i~0#1| 16) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3351#(< (+ |ULTIMATE.start_init_~i~0#1| 15) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {3358#(< (+ |ULTIMATE.start_init_~i~0#1| 16) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3358#(< (+ |ULTIMATE.start_init_~i~0#1| 16) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {3365#(< (+ |ULTIMATE.start_init_~i~0#1| 17) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3358#(< (+ |ULTIMATE.start_init_~i~0#1| 16) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {3365#(< (+ |ULTIMATE.start_init_~i~0#1| 17) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3365#(< (+ |ULTIMATE.start_init_~i~0#1| 17) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {3372#(< (+ |ULTIMATE.start_init_~i~0#1| 18) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3365#(< (+ |ULTIMATE.start_init_~i~0#1| 17) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {3372#(< (+ |ULTIMATE.start_init_~i~0#1| 18) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3372#(< (+ |ULTIMATE.start_init_~i~0#1| 18) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {3379#(< (+ |ULTIMATE.start_init_~i~0#1| 19) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3372#(< (+ |ULTIMATE.start_init_~i~0#1| 18) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {3379#(< (+ |ULTIMATE.start_init_~i~0#1| 19) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3379#(< (+ |ULTIMATE.start_init_~i~0#1| 19) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {3386#(< (+ |ULTIMATE.start_init_~i~0#1| 20) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3379#(< (+ |ULTIMATE.start_init_~i~0#1| 19) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {3386#(< (+ |ULTIMATE.start_init_~i~0#1| 20) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3386#(< (+ |ULTIMATE.start_init_~i~0#1| 20) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {3393#(< (+ |ULTIMATE.start_init_~i~0#1| 21) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3386#(< (+ |ULTIMATE.start_init_~i~0#1| 20) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {3393#(< (+ |ULTIMATE.start_init_~i~0#1| 21) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3393#(< (+ |ULTIMATE.start_init_~i~0#1| 21) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {3400#(< (+ |ULTIMATE.start_init_~i~0#1| 22) |ULTIMATE.start_init_~size#1|)} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {3393#(< (+ |ULTIMATE.start_init_~i~0#1| 21) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#(< (+ |ULTIMATE.start_init_~i~0#1| 22) |ULTIMATE.start_init_~size#1|)} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {3400#(< (+ |ULTIMATE.start_init_~i~0#1| 22) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2915#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {3400#(< (+ |ULTIMATE.start_init_~i~0#1| 22) |ULTIMATE.start_init_~size#1|)} is VALID [2022-02-20 14:26:45,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {2915#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2915#true} is VALID [2022-02-20 14:26:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-02-20 14:26:45,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625450827] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:45,592 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:45,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 25, 25] total 54 [2022-02-20 14:26:45,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368860543] [2022-02-20 14:26:45,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:45,593 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 14:26:45,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:45,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:45,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:45,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-20 14:26:45,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:45,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-20 14:26:45,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=1707, Unknown=0, NotChecked=0, Total=2862 [2022-02-20 14:26:45,691 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:46,058 INFO L93 Difference]: Finished difference Result 193 states and 221 transitions. [2022-02-20 14:26:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-20 14:26:46,058 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-20 14:26:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 205 transitions. [2022-02-20 14:26:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 205 transitions. [2022-02-20 14:26:46,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 205 transitions. [2022-02-20 14:26:46,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:46,197 INFO L225 Difference]: With dead ends: 193 [2022-02-20 14:26:46,197 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 14:26:46,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1155, Invalid=1707, Unknown=0, NotChecked=0, Total=2862 [2022-02-20 14:26:46,199 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 102 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:46,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 67 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 14:26:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2022-02-20 14:26:46,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:46,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 126 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:46,249 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 126 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:46,249 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 126 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:46,251 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2022-02-20 14:26:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2022-02-20 14:26:46,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:46,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:46,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 165 states. [2022-02-20 14:26:46,252 INFO L87 Difference]: Start difference. First operand has 126 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 165 states. [2022-02-20 14:26:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:46,254 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2022-02-20 14:26:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2022-02-20 14:26:46,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:46,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:46,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:46,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2022-02-20 14:26:46,256 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 74 [2022-02-20 14:26:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:46,256 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2022-02-20 14:26:46,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2022-02-20 14:26:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-02-20 14:26:46,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:46,257 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:46,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:46,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:46,472 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:46,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash -374145592, now seen corresponding path program 3 times [2022-02-20 14:26:46,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:46,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824098570] [2022-02-20 14:26:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:46,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {4183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {4183#true} is VALID [2022-02-20 14:26:46,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {4183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {4183#true} is VALID [2022-02-20 14:26:46,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,732 INFO L290 TraceCheckUtils]: 69: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,733 INFO L290 TraceCheckUtils]: 75: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,733 INFO L290 TraceCheckUtils]: 76: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,733 INFO L290 TraceCheckUtils]: 77: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,733 INFO L290 TraceCheckUtils]: 79: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,733 INFO L290 TraceCheckUtils]: 80: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,733 INFO L290 TraceCheckUtils]: 81: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,734 INFO L290 TraceCheckUtils]: 82: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,734 INFO L290 TraceCheckUtils]: 83: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,734 INFO L290 TraceCheckUtils]: 84: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,734 INFO L290 TraceCheckUtils]: 85: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,734 INFO L290 TraceCheckUtils]: 86: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,734 INFO L290 TraceCheckUtils]: 87: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,734 INFO L290 TraceCheckUtils]: 88: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,734 INFO L290 TraceCheckUtils]: 89: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,734 INFO L290 TraceCheckUtils]: 90: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,735 INFO L290 TraceCheckUtils]: 91: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,735 INFO L290 TraceCheckUtils]: 92: Hoare triple {4183#true} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4183#true} is VALID [2022-02-20 14:26:46,735 INFO L290 TraceCheckUtils]: 93: Hoare triple {4183#true} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4183#true} is VALID [2022-02-20 14:26:46,735 INFO L290 TraceCheckUtils]: 94: Hoare triple {4183#true} assume !(init_~i~0#1 < init_~size#1); {4183#true} is VALID [2022-02-20 14:26:46,735 INFO L290 TraceCheckUtils]: 95: Hoare triple {4183#true} assume { :end_inline_init } true;main_~i~1#1 := 0; {4185#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:46,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {4185#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4185#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:46,736 INFO L290 TraceCheckUtils]: 97: Hoare triple {4185#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4185#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 14:26:46,736 INFO L290 TraceCheckUtils]: 98: Hoare triple {4185#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4186#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:46,736 INFO L290 TraceCheckUtils]: 99: Hoare triple {4186#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4186#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:46,737 INFO L290 TraceCheckUtils]: 100: Hoare triple {4186#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4186#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 14:26:46,737 INFO L290 TraceCheckUtils]: 101: Hoare triple {4186#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4187#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:46,737 INFO L290 TraceCheckUtils]: 102: Hoare triple {4187#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4187#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:46,738 INFO L290 TraceCheckUtils]: 103: Hoare triple {4187#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4187#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 14:26:46,738 INFO L290 TraceCheckUtils]: 104: Hoare triple {4187#(<= |ULTIMATE.start_main_~i~1#1| 2)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4188#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:46,738 INFO L290 TraceCheckUtils]: 105: Hoare triple {4188#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4188#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:46,739 INFO L290 TraceCheckUtils]: 106: Hoare triple {4188#(<= |ULTIMATE.start_main_~i~1#1| 3)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4188#(<= |ULTIMATE.start_main_~i~1#1| 3)} is VALID [2022-02-20 14:26:46,739 INFO L290 TraceCheckUtils]: 107: Hoare triple {4188#(<= |ULTIMATE.start_main_~i~1#1| 3)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4189#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:26:46,739 INFO L290 TraceCheckUtils]: 108: Hoare triple {4189#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4189#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:26:46,740 INFO L290 TraceCheckUtils]: 109: Hoare triple {4189#(<= |ULTIMATE.start_main_~i~1#1| 4)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4189#(<= |ULTIMATE.start_main_~i~1#1| 4)} is VALID [2022-02-20 14:26:46,740 INFO L290 TraceCheckUtils]: 110: Hoare triple {4189#(<= |ULTIMATE.start_main_~i~1#1| 4)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4190#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:26:46,740 INFO L290 TraceCheckUtils]: 111: Hoare triple {4190#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4190#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:26:46,740 INFO L290 TraceCheckUtils]: 112: Hoare triple {4190#(<= |ULTIMATE.start_main_~i~1#1| 5)} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4190#(<= |ULTIMATE.start_main_~i~1#1| 5)} is VALID [2022-02-20 14:26:46,741 INFO L290 TraceCheckUtils]: 113: Hoare triple {4190#(<= |ULTIMATE.start_main_~i~1#1| 5)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4191#(<= |ULTIMATE.start_main_~i~1#1| 6)} is VALID [2022-02-20 14:26:46,741 INFO L290 TraceCheckUtils]: 114: Hoare triple {4191#(<= |ULTIMATE.start_main_~i~1#1| 6)} assume !(main_~i~1#1 < 1000000); {4184#false} is VALID [2022-02-20 14:26:46,741 INFO L290 TraceCheckUtils]: 115: Hoare triple {4184#false} main_~i~1#1 := 0; {4184#false} is VALID [2022-02-20 14:26:46,741 INFO L290 TraceCheckUtils]: 116: Hoare triple {4184#false} assume !!(main_~i~1#1 < 1000000); {4184#false} is VALID [2022-02-20 14:26:46,742 INFO L290 TraceCheckUtils]: 117: Hoare triple {4184#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4184#false} is VALID [2022-02-20 14:26:46,742 INFO L290 TraceCheckUtils]: 118: Hoare triple {4184#false} assume !(0 == __VERIFIER_assert_~cond#1); {4184#false} is VALID [2022-02-20 14:26:46,742 INFO L290 TraceCheckUtils]: 119: Hoare triple {4184#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {4184#false} is VALID [2022-02-20 14:26:46,742 INFO L290 TraceCheckUtils]: 120: Hoare triple {4184#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4184#false} is VALID [2022-02-20 14:26:46,742 INFO L290 TraceCheckUtils]: 121: Hoare triple {4184#false} assume !!(main_~i~1#1 < 1000000); {4184#false} is VALID [2022-02-20 14:26:46,742 INFO L290 TraceCheckUtils]: 122: Hoare triple {4184#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4184#false} is VALID [2022-02-20 14:26:46,742 INFO L290 TraceCheckUtils]: 123: Hoare triple {4184#false} assume 0 == __VERIFIER_assert_~cond#1; {4184#false} is VALID [2022-02-20 14:26:46,742 INFO L290 TraceCheckUtils]: 124: Hoare triple {4184#false} assume !false; {4184#false} is VALID [2022-02-20 14:26:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2119 trivial. 0 not checked. [2022-02-20 14:26:46,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:46,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824098570] [2022-02-20 14:26:46,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824098570] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:46,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085882463] [2022-02-20 14:26:46,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:26:46,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:46,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:46,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:46,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 14:26:46,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:26:46,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:46,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 14:26:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:46,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:47,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-20 14:26:49,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:49,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2022-02-20 14:26:49,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {4183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {4183#true} is VALID [2022-02-20 14:26:49,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {4183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,562 INFO L290 TraceCheckUtils]: 50: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,562 INFO L290 TraceCheckUtils]: 51: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,563 INFO L290 TraceCheckUtils]: 53: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,564 INFO L290 TraceCheckUtils]: 54: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,564 INFO L290 TraceCheckUtils]: 55: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,568 INFO L290 TraceCheckUtils]: 62: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,568 INFO L290 TraceCheckUtils]: 63: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,570 INFO L290 TraceCheckUtils]: 66: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,570 INFO L290 TraceCheckUtils]: 67: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,571 INFO L290 TraceCheckUtils]: 69: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,571 INFO L290 TraceCheckUtils]: 70: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,572 INFO L290 TraceCheckUtils]: 71: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,572 INFO L290 TraceCheckUtils]: 72: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,573 INFO L290 TraceCheckUtils]: 73: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,573 INFO L290 TraceCheckUtils]: 74: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,574 INFO L290 TraceCheckUtils]: 75: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,574 INFO L290 TraceCheckUtils]: 76: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,575 INFO L290 TraceCheckUtils]: 77: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,576 INFO L290 TraceCheckUtils]: 79: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,576 INFO L290 TraceCheckUtils]: 80: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,577 INFO L290 TraceCheckUtils]: 81: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,577 INFO L290 TraceCheckUtils]: 82: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,578 INFO L290 TraceCheckUtils]: 83: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,579 INFO L290 TraceCheckUtils]: 85: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,579 INFO L290 TraceCheckUtils]: 86: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,580 INFO L290 TraceCheckUtils]: 87: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,580 INFO L290 TraceCheckUtils]: 88: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,581 INFO L290 TraceCheckUtils]: 89: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,581 INFO L290 TraceCheckUtils]: 90: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,582 INFO L290 TraceCheckUtils]: 91: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:49,583 INFO L290 TraceCheckUtils]: 92: Hoare triple {4198#(and (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|) (= |ULTIMATE.start_init_~size#1| 1000000) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4472#(and (= |ULTIMATE.start_init_~size#1| 1000000) (< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_init_~i~0#1| 4))) 0)))} is VALID [2022-02-20 14:26:49,583 INFO L290 TraceCheckUtils]: 93: Hoare triple {4472#(and (= |ULTIMATE.start_init_~size#1| 1000000) (< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_init_~i~0#1| 4))) 0)))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4476#(and (= |ULTIMATE.start_init_~size#1| 1000000) (exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= |ULTIMATE.start_init_~i~0#1| (+ |v_ULTIMATE.start_init_~i~0#1_86| 1)) (< |v_ULTIMATE.start_init_~i~0#1_86| |ULTIMATE.start_init_~size#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0)))))} is VALID [2022-02-20 14:26:49,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {4476#(and (= |ULTIMATE.start_init_~size#1| 1000000) (exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= |ULTIMATE.start_init_~i~0#1| (+ |v_ULTIMATE.start_init_~i~0#1_86| 1)) (< |v_ULTIMATE.start_init_~i~0#1_86| |ULTIMATE.start_init_~size#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0)))))} assume !(init_~i~0#1 < init_~size#1); {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,585 INFO L290 TraceCheckUtils]: 95: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume { :end_inline_init } true;main_~i~1#1 := 0; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,586 INFO L290 TraceCheckUtils]: 96: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,586 INFO L290 TraceCheckUtils]: 97: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,587 INFO L290 TraceCheckUtils]: 98: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,588 INFO L290 TraceCheckUtils]: 99: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,588 INFO L290 TraceCheckUtils]: 100: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,589 INFO L290 TraceCheckUtils]: 101: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,590 INFO L290 TraceCheckUtils]: 103: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,591 INFO L290 TraceCheckUtils]: 104: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,592 INFO L290 TraceCheckUtils]: 105: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,592 INFO L290 TraceCheckUtils]: 106: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,593 INFO L290 TraceCheckUtils]: 107: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,594 INFO L290 TraceCheckUtils]: 108: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,595 INFO L290 TraceCheckUtils]: 109: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,595 INFO L290 TraceCheckUtils]: 110: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} is VALID [2022-02-20 14:26:49,596 INFO L290 TraceCheckUtils]: 111: Hoare triple {4480#(exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4532#(and (or (not (= |ULTIMATE.start_main_#t~mem4#1.base| 0)) (< |ULTIMATE.start_main_~i~1#1| 999999)) (< |ULTIMATE.start_main_~i~1#1| 1000000))} is VALID [2022-02-20 14:26:49,596 INFO L290 TraceCheckUtils]: 112: Hoare triple {4532#(and (or (not (= |ULTIMATE.start_main_#t~mem4#1.base| 0)) (< |ULTIMATE.start_main_~i~1#1| 999999)) (< |ULTIMATE.start_main_~i~1#1| 1000000))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4536#(< |ULTIMATE.start_main_~i~1#1| 999999)} is VALID [2022-02-20 14:26:49,597 INFO L290 TraceCheckUtils]: 113: Hoare triple {4536#(< |ULTIMATE.start_main_~i~1#1| 999999)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4540#(< |ULTIMATE.start_main_~i~1#1| 1000000)} is VALID [2022-02-20 14:26:49,597 INFO L290 TraceCheckUtils]: 114: Hoare triple {4540#(< |ULTIMATE.start_main_~i~1#1| 1000000)} assume !(main_~i~1#1 < 1000000); {4184#false} is VALID [2022-02-20 14:26:49,597 INFO L290 TraceCheckUtils]: 115: Hoare triple {4184#false} main_~i~1#1 := 0; {4184#false} is VALID [2022-02-20 14:26:49,597 INFO L290 TraceCheckUtils]: 116: Hoare triple {4184#false} assume !!(main_~i~1#1 < 1000000); {4184#false} is VALID [2022-02-20 14:26:49,597 INFO L290 TraceCheckUtils]: 117: Hoare triple {4184#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4184#false} is VALID [2022-02-20 14:26:49,598 INFO L290 TraceCheckUtils]: 118: Hoare triple {4184#false} assume !(0 == __VERIFIER_assert_~cond#1); {4184#false} is VALID [2022-02-20 14:26:49,598 INFO L290 TraceCheckUtils]: 119: Hoare triple {4184#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {4184#false} is VALID [2022-02-20 14:26:49,598 INFO L290 TraceCheckUtils]: 120: Hoare triple {4184#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4184#false} is VALID [2022-02-20 14:26:49,598 INFO L290 TraceCheckUtils]: 121: Hoare triple {4184#false} assume !!(main_~i~1#1 < 1000000); {4184#false} is VALID [2022-02-20 14:26:49,598 INFO L290 TraceCheckUtils]: 122: Hoare triple {4184#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4184#false} is VALID [2022-02-20 14:26:49,598 INFO L290 TraceCheckUtils]: 123: Hoare triple {4184#false} assume 0 == __VERIFIER_assert_~cond#1; {4184#false} is VALID [2022-02-20 14:26:49,598 INFO L290 TraceCheckUtils]: 124: Hoare triple {4184#false} assume !false; {4184#false} is VALID [2022-02-20 14:26:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 2063 trivial. 0 not checked. [2022-02-20 14:26:49,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:50,993 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 50 treesize of output 42 [2022-02-20 14:26:52,359 INFO L290 TraceCheckUtils]: 124: Hoare triple {4184#false} assume !false; {4184#false} is VALID [2022-02-20 14:26:52,359 INFO L290 TraceCheckUtils]: 123: Hoare triple {4184#false} assume 0 == __VERIFIER_assert_~cond#1; {4184#false} is VALID [2022-02-20 14:26:52,359 INFO L290 TraceCheckUtils]: 122: Hoare triple {4184#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4184#false} is VALID [2022-02-20 14:26:52,359 INFO L290 TraceCheckUtils]: 121: Hoare triple {4184#false} assume !!(main_~i~1#1 < 1000000); {4184#false} is VALID [2022-02-20 14:26:52,359 INFO L290 TraceCheckUtils]: 120: Hoare triple {4184#false} main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4184#false} is VALID [2022-02-20 14:26:52,359 INFO L290 TraceCheckUtils]: 119: Hoare triple {4184#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {4184#false} is VALID [2022-02-20 14:26:52,360 INFO L290 TraceCheckUtils]: 118: Hoare triple {4184#false} assume !(0 == __VERIFIER_assert_~cond#1); {4184#false} is VALID [2022-02-20 14:26:52,360 INFO L290 TraceCheckUtils]: 117: Hoare triple {4184#false} assume 0 == main_~flag~0#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1.base == 0 && main_#t~mem6#1.offset == 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4184#false} is VALID [2022-02-20 14:26:52,360 INFO L290 TraceCheckUtils]: 116: Hoare triple {4184#false} assume !!(main_~i~1#1 < 1000000); {4184#false} is VALID [2022-02-20 14:26:52,360 INFO L290 TraceCheckUtils]: 115: Hoare triple {4184#false} main_~i~1#1 := 0; {4184#false} is VALID [2022-02-20 14:26:52,360 INFO L290 TraceCheckUtils]: 114: Hoare triple {4540#(< |ULTIMATE.start_main_~i~1#1| 1000000)} assume !(main_~i~1#1 < 1000000); {4184#false} is VALID [2022-02-20 14:26:52,361 INFO L290 TraceCheckUtils]: 113: Hoare triple {4536#(< |ULTIMATE.start_main_~i~1#1| 999999)} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4540#(< |ULTIMATE.start_main_~i~1#1| 1000000)} is VALID [2022-02-20 14:26:52,361 INFO L290 TraceCheckUtils]: 112: Hoare triple {4610#(or (not (= |ULTIMATE.start_main_#t~mem4#1.base| 0)) (< |ULTIMATE.start_main_~i~1#1| 999999))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4536#(< |ULTIMATE.start_main_~i~1#1| 999999)} is VALID [2022-02-20 14:26:52,362 INFO L290 TraceCheckUtils]: 111: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4610#(or (not (= |ULTIMATE.start_main_#t~mem4#1.base| 0)) (< |ULTIMATE.start_main_~i~1#1| 999999))} is VALID [2022-02-20 14:26:52,363 INFO L290 TraceCheckUtils]: 110: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,363 INFO L290 TraceCheckUtils]: 109: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,364 INFO L290 TraceCheckUtils]: 108: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,364 INFO L290 TraceCheckUtils]: 107: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,364 INFO L290 TraceCheckUtils]: 106: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,365 INFO L290 TraceCheckUtils]: 105: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,365 INFO L290 TraceCheckUtils]: 104: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,366 INFO L290 TraceCheckUtils]: 103: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,366 INFO L290 TraceCheckUtils]: 102: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,367 INFO L290 TraceCheckUtils]: 101: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,367 INFO L290 TraceCheckUtils]: 100: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,368 INFO L290 TraceCheckUtils]: 99: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,368 INFO L290 TraceCheckUtils]: 98: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,369 INFO L290 TraceCheckUtils]: 97: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !(main_#t~mem4#1.base != 0 || main_#t~mem4#1.offset != 0);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,369 INFO L290 TraceCheckUtils]: 96: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume !!(main_~i~1#1 < 1000000);call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,370 INFO L290 TraceCheckUtils]: 95: Hoare triple {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} assume { :end_inline_init } true;main_~i~1#1 := 0; {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,370 INFO L290 TraceCheckUtils]: 94: Hoare triple {4666#(or (forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999))) (< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|))} assume !(init_~i~0#1 < init_~size#1); {4614#(forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999)))} is VALID [2022-02-20 14:26:52,371 INFO L290 TraceCheckUtils]: 93: Hoare triple {4670#(or (forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999))) (< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4666#(or (forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999))) (< |ULTIMATE.start_init_~i~0#1| |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:52,372 INFO L290 TraceCheckUtils]: 92: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4670#(or (forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 1000000)) (< |ULTIMATE.start_main_~i~1#1| 999999))) (< (+ |ULTIMATE.start_init_~i~0#1| 1) |ULTIMATE.start_init_~size#1|))} is VALID [2022-02-20 14:26:52,373 INFO L290 TraceCheckUtils]: 91: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,373 INFO L290 TraceCheckUtils]: 90: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,375 INFO L290 TraceCheckUtils]: 88: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,375 INFO L290 TraceCheckUtils]: 87: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,376 INFO L290 TraceCheckUtils]: 86: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,377 INFO L290 TraceCheckUtils]: 84: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,377 INFO L290 TraceCheckUtils]: 83: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,378 INFO L290 TraceCheckUtils]: 82: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,378 INFO L290 TraceCheckUtils]: 81: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,379 INFO L290 TraceCheckUtils]: 80: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,380 INFO L290 TraceCheckUtils]: 79: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,381 INFO L290 TraceCheckUtils]: 77: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,381 INFO L290 TraceCheckUtils]: 76: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,382 INFO L290 TraceCheckUtils]: 74: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,384 INFO L290 TraceCheckUtils]: 72: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,384 INFO L290 TraceCheckUtils]: 71: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,385 INFO L290 TraceCheckUtils]: 69: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,386 INFO L290 TraceCheckUtils]: 68: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,386 INFO L290 TraceCheckUtils]: 67: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,388 INFO L290 TraceCheckUtils]: 65: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,388 INFO L290 TraceCheckUtils]: 64: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,391 INFO L290 TraceCheckUtils]: 59: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} init_#t~post1#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post1#1;havoc init_#t~post1#1; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(init_~i~0#1 < init_~size#1);call init_#t~malloc2#1.base, init_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_~a#1.base, init_~a#1.offset + 4 * init_~i~0#1, 4);havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {4183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~post3#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~post5#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~1#1, main_~flag~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4000000);havoc main_~i~1#1;havoc main_~flag~0#1;main_~flag~0#1 := 0;assume { :begin_inline_init } true;init_#in~a#1.base, init_#in~a#1.offset, init_#in~size#1 := main_~#a~0#1.base, main_~#a~0#1.offset, 1000000;havoc init_#t~malloc2#1.base, init_#t~malloc2#1.offset, init_#t~post1#1, init_~a#1.base, init_~a#1.offset, init_~size#1, init_~i~0#1;init_~a#1.base, init_~a#1.offset := init_#in~a#1.base, init_#in~a#1.offset;init_~size#1 := init_#in~size#1;havoc init_~i~0#1;init_~i~0#1 := 0; {4674#(and (<= |ULTIMATE.start_init_~size#1| (+ 1000000 (div (+ |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4))) (<= (+ 1000001 (div (+ (- 1) |ULTIMATE.start_main_~#a~0#1.offset| (* (- 1) |ULTIMATE.start_init_~a#1.offset|)) 4)) |ULTIMATE.start_init_~size#1|) (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-20 14:26:52,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {4183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {4183#true} is VALID [2022-02-20 14:26:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 2063 trivial. 0 not checked. [2022-02-20 14:26:52,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085882463] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:52,423 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:52,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-02-20 14:26:52,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109084208] [2022-02-20 14:26:52,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:52,424 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-02-20 14:26:52,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:52,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:52,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:52,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 14:26:52,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:52,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 14:26:52,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-02-20 14:26:52,465 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:52,878 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-02-20 14:26:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 14:26:52,878 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-02-20 14:26:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2022-02-20 14:26:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2022-02-20 14:26:52,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 39 transitions. [2022-02-20 14:26:52,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:52,915 INFO L225 Difference]: With dead ends: 129 [2022-02-20 14:26:52,915 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 14:26:52,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 14:26:52,917 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:52,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 24 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-02-20 14:26:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 14:26:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 14:26:52,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:52,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:52,918 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:52,918 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:52,918 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:26:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:26:52,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:52,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:52,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:26:52,918 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:26:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:52,919 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:26:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:26:52,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:52,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:52,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:52,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 14:26:52,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2022-02-20 14:26:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:52,919 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 14:26:52,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:26:52,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:52,921 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:26:52,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:53,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 14:26:53,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 14:26:53,643 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 35 41) no Hoare annotation was computed. [2022-02-20 14:26:53,643 INFO L854 garLoopResultBuilder]: At program point L35-3(lines 35 41) the Hoare annotation is: (let ((.cse0 (exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= 999999 |v_ULTIMATE.start_init_~i~0#1_86|) (< |v_ULTIMATE.start_init_~i~0#1_86| 1000000) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))) (.cse1 (= |ULTIMATE.start_main_~flag~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~#a~0#1.offset| 0))) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) .cse0 .cse1 .cse2 (< |ULTIMATE.start_main_~i~1#1| 1000000)) (and (= |ULTIMATE.start_main_~i~1#1| 0) .cse0 .cse1 .cse2) (<= 1 |ULTIMATE.start_main_~flag~0#1|))) [2022-02-20 14:26:53,643 INFO L858 garLoopResultBuilder]: For program point L35-4(lines 35 41) no Hoare annotation was computed. [2022-02-20 14:26:53,643 INFO L858 garLoopResultBuilder]: For program point L23-2(lines 23 26) no Hoare annotation was computed. [2022-02-20 14:26:53,643 INFO L854 garLoopResultBuilder]: At program point L23-3(lines 23 26) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|)) (.cse1 (= |ULTIMATE.start_init_~size#1| 1000000)) (.cse2 (= |ULTIMATE.start_main_~flag~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_init_~i~0#1| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_init_~i~0#1_86| Int)) (and (<= |ULTIMATE.start_init_~i~0#1| (+ |v_ULTIMATE.start_init_~i~0#1_86| 1)) (< |v_ULTIMATE.start_init_~i~0#1_86| |ULTIMATE.start_init_~size#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_86| 4))) 0))))))) [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 27) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 40) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point L42-2(lines 42 46) no Hoare annotation was computed. [2022-02-20 14:26:53,644 INFO L854 garLoopResultBuilder]: At program point L42-3(lines 42 46) the Hoare annotation is: (<= 1 |ULTIMATE.start_main_~flag~0#1|) [2022-02-20 14:26:53,644 INFO L858 garLoopResultBuilder]: For program point L42-4(lines 42 46) no Hoare annotation was computed. [2022-02-20 14:26:53,645 INFO L861 garLoopResultBuilder]: At program point L47(lines 28 48) the Hoare annotation is: true [2022-02-20 14:26:53,647 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2022-02-20 14:26:53,648 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 14:26:53,650 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2022-02-20 14:26:53,651 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:26:53,661 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,665 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,665 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 14:26:53,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 14:26:53,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:26:53 BoogieIcfgContainer [2022-02-20 14:26:53,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:26:53,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:26:53,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:26:53,678 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:26:53,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:36" (3/4) ... [2022-02-20 14:26:53,681 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 14:26:53,697 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 14:26:53,697 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 14:26:53,697 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 14:26:53,697 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 14:26:53,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == a && size == 1000000) && flag == 0) && a == 0) && a == a) && i <= 0) || (((((a == a && size == 1000000) && flag == 0) && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (i <= v_ULTIMATE.start_init_~i~0#1_86 + 1 && v_ULTIMATE.start_init_~i~0#1_86 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) [2022-02-20 14:26:53,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((#memory_$Pointer$[a][a] == 0 && #memory_$Pointer$[a][a] == 0) && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (999999 <= v_ULTIMATE.start_init_~i~0#1_86 && v_ULTIMATE.start_init_~i~0#1_86 < 1000000) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) && flag == 0) && a == 0) && i < 1000000) || (((i == 0 && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (999999 <= v_ULTIMATE.start_init_~i~0#1_86 && v_ULTIMATE.start_init_~i~0#1_86 < 1000000) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) && flag == 0) && a == 0)) || 1 <= flag [2022-02-20 14:26:53,721 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:26:53,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:26:53,721 INFO L158 Benchmark]: Toolchain (without parser) took 17562.84ms. Allocated memory was 90.2MB in the beginning and 272.6MB in the end (delta: 182.5MB). Free memory was 54.8MB in the beginning and 103.4MB in the end (delta: -48.5MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. [2022-02-20 14:26:53,722 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 59.9MB in the beginning and 59.9MB in the end (delta: 23.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:26:53,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.09ms. Allocated memory is still 90.2MB. Free memory was 54.6MB in the beginning and 65.0MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:26:53,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.89ms. Allocated memory is still 90.2MB. Free memory was 65.0MB in the beginning and 63.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:26:53,722 INFO L158 Benchmark]: Boogie Preprocessor took 36.23ms. Allocated memory is still 90.2MB. Free memory was 63.3MB in the beginning and 61.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:26:53,722 INFO L158 Benchmark]: RCFGBuilder took 263.41ms. Allocated memory is still 90.2MB. Free memory was 61.8MB in the beginning and 50.4MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:26:53,723 INFO L158 Benchmark]: TraceAbstraction took 16933.20ms. Allocated memory was 90.2MB in the beginning and 272.6MB in the end (delta: 182.5MB). Free memory was 49.8MB in the beginning and 105.5MB in the end (delta: -55.7MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2022-02-20 14:26:53,723 INFO L158 Benchmark]: Witness Printer took 42.57ms. Allocated memory is still 272.6MB. Free memory was 105.5MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:26:53,724 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 59.9MB in the beginning and 59.9MB in the end (delta: 23.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.09ms. Allocated memory is still 90.2MB. Free memory was 54.6MB in the beginning and 65.0MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.89ms. Allocated memory is still 90.2MB. Free memory was 65.0MB in the beginning and 63.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.23ms. Allocated memory is still 90.2MB. Free memory was 63.3MB in the beginning and 61.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 263.41ms. Allocated memory is still 90.2MB. Free memory was 61.8MB in the beginning and 50.4MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16933.20ms. Allocated memory was 90.2MB in the beginning and 272.6MB in the end (delta: 182.5MB). Free memory was 49.8MB in the beginning and 105.5MB in the end (delta: -55.7MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. * Witness Printer took 42.57ms. Allocated memory is still 272.6MB. Free memory was 105.5MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 11, TraceHistogramMax: 46, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 427 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 427 mSDsluCounter, 504 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 345 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 492 IncrementalHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 159 mSDtfsCounter, 492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 749 GetRequests, 587 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=10, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 158 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 61 NumberOfFragments, 140 HoareAnnotationTreeSize, 4 FomulaSimplifications, 69 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 2237 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 765 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1064 ConstructedInterpolants, 37 QuantifiedInterpolants, 6510 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1819 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 7432/8984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant [2022-02-20 14:26:53,731 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,731 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,731 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,732 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,732 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,732 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] Derived loop invariant: (((((a == a && size == 1000000) && flag == 0) && a == 0) && a == a) && i <= 0) || (((((a == a && size == 1000000) && flag == 0) && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (i <= v_ULTIMATE.start_init_~i~0#1_86 + 1 && v_ULTIMATE.start_init_~i~0#1_86 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 <= flag - InvariantResult [Line: 35]: Loop Invariant [2022-02-20 14:26:53,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 14:26:53,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,733 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,733 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,734 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,734 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,734 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,734 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 14:26:53,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,735 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] [2022-02-20 14:26:53,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 14:26:53,736 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_86,QUANTIFIED] Derived loop invariant: ((((((#memory_$Pointer$[a][a] == 0 && #memory_$Pointer$[a][a] == 0) && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (999999 <= v_ULTIMATE.start_init_~i~0#1_86 && v_ULTIMATE.start_init_~i~0#1_86 < 1000000) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) && flag == 0) && a == 0) && i < 1000000) || (((i == 0 && (\exists v_ULTIMATE.start_init_~i~0#1_86 : int :: (999999 <= v_ULTIMATE.start_init_~i~0#1_86 && v_ULTIMATE.start_init_~i~0#1_86 < 1000000) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_86 * 4] == 0))) && flag == 0) && a == 0)) || 1 <= flag RESULT: Ultimate proved your program to be correct! [2022-02-20 14:26:53,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE