/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:14:48,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:14:48,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:14:48,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:14:48,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:14:49,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:14:49,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:14:49,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:14:49,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:14:49,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:14:49,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:14:49,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:14:49,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:14:49,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:14:49,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:14:49,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:14:49,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:14:49,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:14:49,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:14:49,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:14:49,030 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:14:49,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:14:49,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:14:49,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:14:49,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:14:49,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:14:49,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:14:49,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:14:49,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:14:49,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:14:49,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:14:49,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:14:49,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:14:49,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:14:49,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:14:49,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:14:49,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:14:49,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:14:49,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:14:49,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:14:49,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:14:49,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:14:49,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:14:49,051 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:14:49,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:14:49,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:14:49,052 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:14:49,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:14:49,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:14:49,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:14:49,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:14:49,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:14:49,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:14:49,053 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:14:49,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:14:49,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:14:49,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:14:49,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:14:49,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:14:49,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:14:49,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:14:49,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:14:49,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:14:49,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:14:49,054 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:14:49,054 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:14:49,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:14:49,055 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:14:49,055 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:14:49,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:14:49,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:14:49,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:14:49,287 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:14:49,288 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:14:49,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-15 06:14:49,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f08060c0/0a18efa02c5c4958a3eba2104af39b64/FLAG96b1dccbe [2022-04-15 06:14:49,652 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:14:49,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-15 06:14:49,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f08060c0/0a18efa02c5c4958a3eba2104af39b64/FLAG96b1dccbe [2022-04-15 06:14:50,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f08060c0/0a18efa02c5c4958a3eba2104af39b64 [2022-04-15 06:14:50,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:14:50,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:14:50,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:14:50,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:14:50,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:14:50,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f9571e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50, skipping insertion in model container [2022-04-15 06:14:50,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:14:50,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:14:50,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i[1009,1022] [2022-04-15 06:14:50,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:14:50,275 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:14:50,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i[1009,1022] [2022-04-15 06:14:50,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:14:50,300 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:14:50,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50 WrapperNode [2022-04-15 06:14:50,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:14:50,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:14:50,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:14:50,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:14:50,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:14:50,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:14:50,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:14:50,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:14:50,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50" (1/1) ... [2022-04-15 06:14:50,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:14:50,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:50,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:14:50,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:14:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:14:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:14:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:14:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:14:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:14:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:14:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 06:14:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:14:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:14:50,396 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:14:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:14:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:14:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:14:50,445 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:14:50,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:14:50,635 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:14:50,647 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:14:50,647 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 06:14:50,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:14:50 BoogieIcfgContainer [2022-04-15 06:14:50,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:14:50,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:14:50,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:14:50,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:14:50,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:14:50" (1/3) ... [2022-04-15 06:14:50,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c0f8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:14:50, skipping insertion in model container [2022-04-15 06:14:50,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:50" (2/3) ... [2022-04-15 06:14:50,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c0f8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:14:50, skipping insertion in model container [2022-04-15 06:14:50,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:14:50" (3/3) ... [2022-04-15 06:14:50,665 INFO L111 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2022-04-15 06:14:50,669 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:14:50,669 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:14:50,705 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:14:50,712 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:14:50,713 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:14:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:14:50,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:50,735 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:50,736 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 1 times [2022-04-15 06:14:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:50,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926552699] [2022-04-15 06:14:50,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:14:50,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 2 times [2022-04-15 06:14:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:50,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168317000] [2022-04-15 06:14:50,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:50,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {28#true} is VALID [2022-04-15 06:14:51,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 06:14:51,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-15 06:14:51,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:51,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {28#true} is VALID [2022-04-15 06:14:51,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 06:14:51,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-15 06:14:51,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2022-04-15 06:14:51,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28#true} is VALID [2022-04-15 06:14:51,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {33#(= main_~i~0 0)} is VALID [2022-04-15 06:14:51,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {34#(<= main_~n~0 0)} is VALID [2022-04-15 06:14:51,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#(<= main_~n~0 0)} ~i~1 := 0; {35#(and (<= main_~n~0 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:51,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#(and (<= main_~n~0 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29#false} is VALID [2022-04-15 06:14:51,015 INFO L272 TraceCheckUtils]: 10: Hoare triple {29#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29#false} is VALID [2022-04-15 06:14:51,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 06:14:51,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 06:14:51,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 06:14:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:51,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:51,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168317000] [2022-04-15 06:14:51,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168317000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:51,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:51,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:14:51,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:51,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926552699] [2022-04-15 06:14:51,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926552699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:51,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:51,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:14:51,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770096561] [2022-04-15 06:14:51,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:51,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:14:51,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:51,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:51,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:51,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:14:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:51,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:14:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:14:51,072 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:51,289 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-15 06:14:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:14:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:14:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-15 06:14:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-15 06:14:51,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-15 06:14:51,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:51,351 INFO L225 Difference]: With dead ends: 48 [2022-04-15 06:14:51,351 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 06:14:51,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:14:51,355 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:51,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 39 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:14:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 06:14:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 06:14:51,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:51,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:51,376 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:51,377 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:51,379 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 06:14:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 06:14:51,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:51,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:51,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 06:14:51,380 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 06:14:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:51,381 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 06:14:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 06:14:51,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:51,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:51,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:51,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-15 06:14:51,384 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-15 06:14:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:51,384 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-15 06:14:51,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:51,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-15 06:14:51,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 06:14:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:14:51,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:51,404 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:51,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:14:51,404 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:51,405 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 1 times [2022-04-15 06:14:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:51,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247936145] [2022-04-15 06:14:51,417 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:51,417 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:14:51,417 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:14:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 2 times [2022-04-15 06:14:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:51,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88042428] [2022-04-15 06:14:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:51,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {227#true} is VALID [2022-04-15 06:14:51,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-15 06:14:51,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-15 06:14:51,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:51,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {227#true} is VALID [2022-04-15 06:14:51,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-15 06:14:51,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-15 06:14:51,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-15 06:14:51,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {227#true} is VALID [2022-04-15 06:14:51,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 06:14:51,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {233#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 06:14:51,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 06:14:51,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} assume !(~i~0 < ~n~0); {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 06:14:51,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} ~i~1 := 0; {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:51,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {236#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:14:51,608 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {237#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:14:51,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {238#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:14:51,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {228#false} is VALID [2022-04-15 06:14:51,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-15 06:14:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:51,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:51,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88042428] [2022-04-15 06:14:51,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88042428] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:51,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350477570] [2022-04-15 06:14:51,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:14:51,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:51,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:51,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:51,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 06:14:51,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:14:51,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:51,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 06:14:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:51,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:51,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-15 06:14:51,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-15 06:14:51,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-15 06:14:51,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#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(9, 2); {227#true} is VALID [2022-04-15 06:14:51,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-15 06:14:51,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-15 06:14:51,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-15 06:14:51,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {227#true} is VALID [2022-04-15 06:14:51,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 06:14:51,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 06:14:51,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 06:14:51,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} assume !(~i~0 < ~n~0); {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 06:14:51,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} ~i~1 := 0; {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:51,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {236#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:14:51,874 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:14:51,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:51,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-15 06:14:51,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-15 06:14:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:51,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:52,019 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 14 treesize of output 12 [2022-04-15 06:14:52,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-04-15 06:14:52,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-15 06:14:52,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-15 06:14:52,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:52,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:14:52,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {236#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:14:52,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} ~i~1 := 0; {302#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:14:52,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} assume !(~i~0 < ~n~0); {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-15 06:14:52,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-15 06:14:52,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(= 0 (* main_~i~0 4))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-15 06:14:52,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {316#(= 0 (* main_~i~0 4))} is VALID [2022-04-15 06:14:52,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {227#true} is VALID [2022-04-15 06:14:52,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-15 06:14:52,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-15 06:14:52,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-15 06:14:52,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#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(9, 2); {227#true} is VALID [2022-04-15 06:14:52,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-15 06:14:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:52,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350477570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:52,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:52,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2022-04-15 06:14:52,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:52,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247936145] [2022-04-15 06:14:52,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247936145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:52,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:52,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:14:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145155235] [2022-04-15 06:14:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:52,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:14:52,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:52,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:52,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:52,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:14:52,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:14:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:14:52,074 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:52,456 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 06:14:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:14:52,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:14:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-15 06:14:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-15 06:14:52,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-15 06:14:52,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:52,491 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:14:52,491 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:14:52,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:14:52,495 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:52,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 48 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:14:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:14:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-15 06:14:52,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:52,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:52,500 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:52,500 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:52,502 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 06:14:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 06:14:52,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:52,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:52,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 06:14:52,503 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 06:14:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:52,504 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 06:14:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 06:14:52,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:52,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:52,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:52,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-15 06:14:52,505 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2022-04-15 06:14:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:52,506 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-15 06:14:52,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:52,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-15 06:14:52,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 06:14:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:14:52,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:52,530 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:52,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:52,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:52,741 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 1 times [2022-04-15 06:14:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:52,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436865024] [2022-04-15 06:14:52,744 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:52,744 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:14:52,744 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:14:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 2 times [2022-04-15 06:14:52,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:52,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226163159] [2022-04-15 06:14:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:52,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:52,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {534#true} is VALID [2022-04-15 06:14:52,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 06:14:52,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-15 06:14:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 06:14:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:52,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-15 06:14:52,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-15 06:14:52,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 06:14:52,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {542#(and (<= main_~n~0 1) (= main_~i~1 0))} #68#return; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 06:14:52,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:52,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {534#true} is VALID [2022-04-15 06:14:52,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 06:14:52,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-15 06:14:52,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-15 06:14:52,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {534#true} is VALID [2022-04-15 06:14:52,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {539#(= main_~i~0 0)} is VALID [2022-04-15 06:14:52,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {539#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {539#(= main_~i~0 0)} is VALID [2022-04-15 06:14:52,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {540#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:52,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {541#(<= main_~n~0 1)} is VALID [2022-04-15 06:14:52,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= main_~n~0 1)} ~i~1 := 0; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 06:14:52,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 06:14:52,842 INFO L272 TraceCheckUtils]: 12: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {534#true} is VALID [2022-04-15 06:14:52,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-15 06:14:52,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-15 06:14:52,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 06:14:52,843 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {534#true} {542#(and (<= main_~n~0 1) (= main_~i~1 0))} #68#return; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 06:14:52,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} havoc #t~mem5; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 06:14:52,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {547#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:14:52,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {535#false} is VALID [2022-04-15 06:14:52,844 INFO L272 TraceCheckUtils]: 20: Hoare triple {535#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {535#false} is VALID [2022-04-15 06:14:52,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-15 06:14:52,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-15 06:14:52,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-15 06:14:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:52,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:52,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226163159] [2022-04-15 06:14:52,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226163159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:52,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601201425] [2022-04-15 06:14:52,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:14:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:52,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:52,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 06:14:52,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:14:52,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:52,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:14:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:52,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:53,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-15 06:14:53,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#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(9, 2); {534#true} is VALID [2022-04-15 06:14:53,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 06:14:53,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-15 06:14:53,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-15 06:14:53,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {534#true} is VALID [2022-04-15 06:14:53,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {570#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:53,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {570#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:53,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {540#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:53,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {541#(<= main_~n~0 1)} is VALID [2022-04-15 06:14:53,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= main_~n~0 1)} ~i~1 := 0; {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 06:14:53,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 06:14:53,081 INFO L272 TraceCheckUtils]: 12: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {534#true} is VALID [2022-04-15 06:14:53,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-15 06:14:53,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-15 06:14:53,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 06:14:53,082 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {534#true} {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #68#return; {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 06:14:53,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} havoc #t~mem5; {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 06:14:53,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {608#(and (<= 1 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 06:14:53,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {608#(and (<= 1 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {535#false} is VALID [2022-04-15 06:14:53,084 INFO L272 TraceCheckUtils]: 20: Hoare triple {535#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {535#false} is VALID [2022-04-15 06:14:53,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-15 06:14:53,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-15 06:14:53,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-15 06:14:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:53,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:53,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-15 06:14:53,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-15 06:14:53,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-15 06:14:53,210 INFO L272 TraceCheckUtils]: 20: Hoare triple {535#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {535#false} is VALID [2022-04-15 06:14:53,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {535#false} is VALID [2022-04-15 06:14:53,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {547#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:14:53,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:53,224 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {534#true} {639#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:53,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 06:14:53,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-15 06:14:53,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-15 06:14:53,225 INFO L272 TraceCheckUtils]: 12: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {534#true} is VALID [2022-04-15 06:14:53,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:53,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= main_~n~0 1)} ~i~1 := 0; {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:53,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {541#(<= main_~n~0 1)} is VALID [2022-04-15 06:14:53,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {540#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:53,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {570#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:53,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {570#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:53,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {534#true} is VALID [2022-04-15 06:14:53,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-15 06:14:53,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-15 06:14:53,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 06:14:53,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#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(9, 2); {534#true} is VALID [2022-04-15 06:14:53,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-15 06:14:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:53,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601201425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:53,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:53,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-15 06:14:53,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:53,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436865024] [2022-04-15 06:14:53,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436865024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:53,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:53,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:14:53,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659248097] [2022-04-15 06:14:53,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:53,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 06:14:53,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:53,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:53,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:53,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:14:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:14:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:14:53,249 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:53,482 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-15 06:14:53,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:14:53,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 06:14:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 06:14:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 06:14:53,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 06:14:53,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:53,519 INFO L225 Difference]: With dead ends: 46 [2022-04-15 06:14:53,519 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:14:53,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:14:53,520 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:53,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:14:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:14:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-15 06:14:53,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:53,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:53,530 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:53,531 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:53,532 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 06:14:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 06:14:53,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:53,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:53,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 06:14:53,533 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 06:14:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:53,534 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 06:14:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 06:14:53,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:53,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:53,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:53,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-15 06:14:53,536 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2022-04-15 06:14:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:53,536 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-15 06:14:53,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:53,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-15 06:14:53,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 06:14:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:14:53,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:53,567 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:53,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 06:14:53,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 06:14:53,778 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:53,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 3 times [2022-04-15 06:14:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:53,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063841898] [2022-04-15 06:14:53,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:53,782 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:14:53,782 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:14:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 4 times [2022-04-15 06:14:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:53,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666693771] [2022-04-15 06:14:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:53,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {916#true} is VALID [2022-04-15 06:14:53,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 06:14:53,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-15 06:14:53,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 06:14:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:53,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-15 06:14:53,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-15 06:14:53,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 06:14:53,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:53,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:53,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {916#true} is VALID [2022-04-15 06:14:53,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 06:14:53,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-15 06:14:53,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-15 06:14:53,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {916#true} is VALID [2022-04-15 06:14:53,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {921#(= main_~i~0 0)} is VALID [2022-04-15 06:14:53,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {921#(= main_~i~0 0)} is VALID [2022-04-15 06:14:53,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {921#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {922#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:14:53,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {923#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:14:53,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {923#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-15 06:14:53,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !(~i~0 < ~n~0); {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-15 06:14:53,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} ~i~1 := 0; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:53,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:53,964 INFO L272 TraceCheckUtils]: 14: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {916#true} is VALID [2022-04-15 06:14:53,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-15 06:14:53,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-15 06:14:53,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 06:14:53,965 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {916#true} {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:53,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} havoc #t~mem5; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:53,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {930#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:14:53,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {930#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {931#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:14:53,966 INFO L272 TraceCheckUtils]: 22: Hoare triple {931#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {932#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:14:53,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {932#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {933#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:14:53,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {933#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {917#false} is VALID [2022-04-15 06:14:53,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-15 06:14:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:53,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666693771] [2022-04-15 06:14:53,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666693771] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:53,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147912844] [2022-04-15 06:14:53,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:14:53,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:53,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:53,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:53,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 06:14:54,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:14:54,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:54,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:14:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:54,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:54,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:14:55,319 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:14:55,319 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 23 treesize of output 10 [2022-04-15 06:14:55,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {916#true} is VALID [2022-04-15 06:14:55,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#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(9, 2); {916#true} is VALID [2022-04-15 06:14:55,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 06:14:55,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-15 06:14:55,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-15 06:14:55,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {916#true} is VALID [2022-04-15 06:14:55,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {956#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:55,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {956#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:55,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {956#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {963#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:55,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {963#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {967#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1))} is VALID [2022-04-15 06:14:55,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {967#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {971#(exists ((v_main_~i~0_18 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1) (<= main_~i~0 (+ v_main_~i~0_18 1))))} is VALID [2022-04-15 06:14:55,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {971#(exists ((v_main_~i~0_18 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1) (<= main_~i~0 (+ v_main_~i~0_18 1))))} assume !(~i~0 < ~n~0); {975#(exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1)))} is VALID [2022-04-15 06:14:55,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {975#(exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1)))} ~i~1 := 0; {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:14:55,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:14:55,412 INFO L272 TraceCheckUtils]: 14: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-15 06:14:55,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} ~cond := #in~cond; {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-15 06:14:55,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} assume !(0 == ~cond); {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-15 06:14:55,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} assume true; {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-15 06:14:55,414 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} #68#return; {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:14:55,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} havoc #t~mem5; {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:14:55,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1005#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))))} is VALID [2022-04-15 06:14:55,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {1005#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {931#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:14:55,422 INFO L272 TraceCheckUtils]: 22: Hoare triple {931#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:14:55,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {1012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:14:55,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {1016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {917#false} is VALID [2022-04-15 06:14:55,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-15 06:14:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:14:55,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:55,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147912844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:55,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:14:55,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-04-15 06:14:55,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:55,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063841898] [2022-04-15 06:14:55,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063841898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:55,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:55,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:14:55,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480206120] [2022-04-15 06:14:55,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:55,746 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 06:14:55,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:55,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:55,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:55,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:14:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:55,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:14:55,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:14:55,764 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:56,277 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-15 06:14:56,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:14:56,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 06:14:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 06:14:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 06:14:56,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-15 06:14:56,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:56,313 INFO L225 Difference]: With dead ends: 42 [2022-04-15 06:14:56,313 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 06:14:56,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:14:56,315 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:56,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 62 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:14:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 06:14:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-15 06:14:56,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:56,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:14:56,326 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:14:56,326 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:14:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:56,328 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-15 06:14:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 06:14:56,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:56,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:56,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-15 06:14:56,329 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-15 06:14:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:56,331 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-15 06:14:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 06:14:56,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:56,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:56,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:56,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:14:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-15 06:14:56,345 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2022-04-15 06:14:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:56,345 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-15 06:14:56,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:14:56,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-15 06:14:56,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 06:14:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:14:56,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:56,389 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:56,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 06:14:56,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:56,603 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 5 times [2022-04-15 06:14:56,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:56,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038307730] [2022-04-15 06:14:56,609 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:56,609 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:14:56,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:14:56,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 6 times [2022-04-15 06:14:56,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:56,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239603147] [2022-04-15 06:14:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:56,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:56,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:56,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {1326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {1306#true} is VALID [2022-04-15 06:14:56,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:56,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-15 06:14:56,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 06:14:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:56,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 06:14:56,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 06:14:56,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:56,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} #68#return; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 06:14:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 06:14:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:56,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 06:14:56,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 06:14:56,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:56,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1320#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:56,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:56,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {1306#true} is VALID [2022-04-15 06:14:56,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:56,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-15 06:14:56,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-15 06:14:56,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1306#true} is VALID [2022-04-15 06:14:56,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1311#(= main_~i~0 0)} is VALID [2022-04-15 06:14:56,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {1311#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1311#(= main_~i~0 0)} is VALID [2022-04-15 06:14:56,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {1311#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1312#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:56,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:56,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1313#(<= main_~i~0 2)} is VALID [2022-04-15 06:14:56,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1314#(<= main_~n~0 2)} is VALID [2022-04-15 06:14:56,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~n~0 2)} ~i~1 := 0; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 06:14:56,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 06:14:56,754 INFO L272 TraceCheckUtils]: 14: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 06:14:56,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 06:14:56,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 06:14:56,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:56,754 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1306#true} {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} #68#return; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 06:14:56,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} havoc #t~mem5; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 06:14:56,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:56,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:56,755 INFO L272 TraceCheckUtils]: 22: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 06:14:56,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 06:14:56,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 06:14:56,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:56,756 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1306#true} {1320#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:56,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:56,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1325#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:14:56,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1307#false} is VALID [2022-04-15 06:14:56,757 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1307#false} is VALID [2022-04-15 06:14:56,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-15 06:14:56,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-15 06:14:56,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-15 06:14:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:14:56,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239603147] [2022-04-15 06:14:56,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239603147] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188364646] [2022-04-15 06:14:56,758 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:14:56,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:56,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:56,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:56,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 06:14:56,822 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 06:14:56,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:56,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:14:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:56,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:57,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-15 06:14:57,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#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(9, 2); {1306#true} is VALID [2022-04-15 06:14:57,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:57,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-15 06:14:57,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-15 06:14:57,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1306#true} is VALID [2022-04-15 06:14:57,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1348#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:57,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:57,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {1348#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1312#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:57,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:57,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1313#(<= main_~i~0 2)} is VALID [2022-04-15 06:14:57,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1314#(<= main_~n~0 2)} is VALID [2022-04-15 06:14:57,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~n~0 2)} ~i~1 := 0; {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-15 06:14:57,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-15 06:14:57,041 INFO L272 TraceCheckUtils]: 14: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 06:14:57,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 06:14:57,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 06:14:57,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:57,042 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1306#true} {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} #68#return; {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-15 06:14:57,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} havoc #t~mem5; {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-15 06:14:57,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-15 06:14:57,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-15 06:14:57,043 INFO L272 TraceCheckUtils]: 22: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 06:14:57,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 06:14:57,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 06:14:57,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:57,044 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1306#true} {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #68#return; {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-15 06:14:57,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} havoc #t~mem5; {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-15 06:14:57,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1417#(and (<= main_~n~0 2) (<= 2 main_~i~1))} is VALID [2022-04-15 06:14:57,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {1417#(and (<= main_~n~0 2) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1307#false} is VALID [2022-04-15 06:14:57,045 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1307#false} is VALID [2022-04-15 06:14:57,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-15 06:14:57,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-15 06:14:57,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-15 06:14:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:14:57,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:14:57,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-15 06:14:57,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-15 06:14:57,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-15 06:14:57,228 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1307#false} is VALID [2022-04-15 06:14:57,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1307#false} is VALID [2022-04-15 06:14:57,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1325#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:14:57,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:57,230 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1306#true} {1320#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:57,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:57,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 06:14:57,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 06:14:57,230 INFO L272 TraceCheckUtils]: 22: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 06:14:57,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:57,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:14:57,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:14:57,232 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1306#true} {1472#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:14:57,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:57,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 06:14:57,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 06:14:57,232 INFO L272 TraceCheckUtils]: 14: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 06:14:57,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:14:57,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~n~0 2)} ~i~1 := 0; {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:14:57,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1314#(<= main_~n~0 2)} is VALID [2022-04-15 06:14:57,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1313#(<= main_~i~0 2)} is VALID [2022-04-15 06:14:57,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:57,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {1348#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1312#(<= main_~i~0 1)} is VALID [2022-04-15 06:14:57,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:57,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1348#(<= main_~i~0 0)} is VALID [2022-04-15 06:14:57,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1306#true} is VALID [2022-04-15 06:14:57,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-15 06:14:57,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-15 06:14:57,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 06:14:57,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#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(9, 2); {1306#true} is VALID [2022-04-15 06:14:57,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-15 06:14:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:14:57,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188364646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:14:57,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:14:57,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-04-15 06:14:57,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:57,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038307730] [2022-04-15 06:14:57,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038307730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:57,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:57,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:14:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856374055] [2022-04-15 06:14:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-04-15 06:14:57,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:57,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:57,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:57,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:14:57,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:57,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:14:57,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:14:57,259 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:57,582 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 06:14:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:14:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-04-15 06:14:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-15 06:14:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-15 06:14:57,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-15 06:14:57,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:57,624 INFO L225 Difference]: With dead ends: 60 [2022-04-15 06:14:57,624 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 06:14:57,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:14:57,625 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:57,626 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 44 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:14:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 06:14:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-15 06:14:57,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:57,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:14:57,635 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:14:57,635 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:14:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:57,636 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-15 06:14:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 06:14:57,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:57,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:57,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-15 06:14:57,637 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-15 06:14:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:57,640 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-15 06:14:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 06:14:57,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:57,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:57,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:57,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:14:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-15 06:14:57,642 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-04-15 06:14:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:57,642 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-15 06:14:57,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:57,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-15 06:14:57,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:57,677 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 06:14:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:14:57,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:57,677 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:57,694 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-04-15 06:14:57,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:57,887 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 7 times [2022-04-15 06:14:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:57,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74963145] [2022-04-15 06:14:57,895 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:14:57,895 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:14:57,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:14:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 8 times [2022-04-15 06:14:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:57,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31447756] [2022-04-15 06:14:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:58,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {1851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {1827#true} is VALID [2022-04-15 06:14:58,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 06:14:58,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-15 06:14:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:14:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:58,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-15 06:14:58,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-15 06:14:58,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 06:14:58,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:14:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:58,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-15 06:14:58,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-15 06:14:58,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 06:14:58,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:14:58,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {1827#true} call ULTIMATE.init(); {1851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:58,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {1851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {1827#true} is VALID [2022-04-15 06:14:58,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 06:14:58,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-15 06:14:58,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-15 06:14:58,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {1827#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1827#true} is VALID [2022-04-15 06:14:58,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1832#(= main_~i~0 0)} is VALID [2022-04-15 06:14:58,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {1832#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1832#(= main_~i~0 0)} is VALID [2022-04-15 06:14:58,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {1832#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:14:58,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:14:58,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1834#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:14:58,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:14:58,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-15 06:14:58,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-15 06:14:58,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:58,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:58,101 INFO L272 TraceCheckUtils]: 16: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1827#true} is VALID [2022-04-15 06:14:58,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-15 06:14:58,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-15 06:14:58,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 06:14:58,103 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1827#true} {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:58,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} havoc #t~mem5; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:14:58,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:14:58,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:14:58,104 INFO L272 TraceCheckUtils]: 24: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1827#true} is VALID [2022-04-15 06:14:58,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-15 06:14:58,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-15 06:14:58,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 06:14:58,105 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1827#true} {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:14:58,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:14:58,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:14:58,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {1847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1848#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:14:58,107 INFO L272 TraceCheckUtils]: 32: Hoare triple {1848#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:14:58,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {1849#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1850#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:14:58,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {1850#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1828#false} is VALID [2022-04-15 06:14:58,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-15 06:14:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:14:58,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:58,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31447756] [2022-04-15 06:14:58,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31447756] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:14:58,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897834413] [2022-04-15 06:14:58,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:14:58,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:14:58,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:58,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:14:58,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 06:14:58,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:14:58,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:14:58,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:14:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:58,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:14:58,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:15:00,097 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:15:00,097 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 23 treesize of output 10 [2022-04-15 06:15:00,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {1827#true} call ULTIMATE.init(); {1827#true} is VALID [2022-04-15 06:15:00,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#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(9, 2); {1827#true} is VALID [2022-04-15 06:15:00,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 06:15:00,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-15 06:15:00,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-15 06:15:00,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1827#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1827#true} is VALID [2022-04-15 06:15:00,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1873#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:00,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {1873#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1873#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:00,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1880#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:00,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {1880#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1880#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:00,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {1880#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1887#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:00,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {1887#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1891#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:00,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {1891#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1895#(exists ((v_main_~i~0_30 Int)) (and (<= main_~i~0 (+ v_main_~i~0_30 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2)))} is VALID [2022-04-15 06:15:00,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {1895#(exists ((v_main_~i~0_30 Int)) (and (<= main_~i~0 (+ v_main_~i~0_30 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2)))} assume !(~i~0 < ~n~0); {1899#(exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1))))} is VALID [2022-04-15 06:15:00,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {1899#(exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1))))} ~i~1 := 0; {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 06:15:00,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 06:15:00,182 INFO L272 TraceCheckUtils]: 16: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 06:15:00,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} ~cond := #in~cond; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 06:15:00,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume !(0 == ~cond); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 06:15:00,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume true; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 06:15:00,191 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #68#return; {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 06:15:00,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} havoc #t~mem5; {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 06:15:00,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 06:15:00,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 06:15:00,195 INFO L272 TraceCheckUtils]: 24: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 06:15:00,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} ~cond := #in~cond; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 06:15:00,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume !(0 == ~cond); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 06:15:00,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume true; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 06:15:00,197 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #68#return; {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 06:15:00,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} havoc #t~mem5; {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 06:15:00,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1954#(and (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:00,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {1954#(and (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1848#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:00,199 INFO L272 TraceCheckUtils]: 32: Hoare triple {1848#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:15:00,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {1961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:15:00,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {1965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1828#false} is VALID [2022-04-15 06:15:00,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-15 06:15:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:15:00,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:00,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897834413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:00,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:15:00,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-04-15 06:15:00,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:00,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74963145] [2022-04-15 06:15:00,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74963145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:00,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:00,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:15:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270268479] [2022-04-15 06:15:00,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:00,478 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-15 06:15:00,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:00,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:15:00,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:00,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:15:00,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:00,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:15:00,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:15:00,500 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:15:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:01,303 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-04-15 06:15:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:15:01,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-15 06:15:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:15:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 06:15:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:15:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 06:15:01,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-15 06:15:01,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:01,354 INFO L225 Difference]: With dead ends: 52 [2022-04-15 06:15:01,354 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 06:15:01,354 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:15:01,355 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:01,355 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 65 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:15:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 06:15:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-04-15 06:15:01,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:01,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:01,364 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:01,365 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:01,366 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 06:15:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 06:15:01,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:01,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:01,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-15 06:15:01,367 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-15 06:15:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:01,368 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 06:15:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 06:15:01,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:01,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:01,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:01,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-15 06:15:01,369 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2022-04-15 06:15:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:01,369 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-15 06:15:01,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:15:01,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-15 06:15:01,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 06:15:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:15:01,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:01,414 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:01,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:01,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:01,623 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:01,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 9 times [2022-04-15 06:15:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:01,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [644615401] [2022-04-15 06:15:01,626 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:01,626 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:01,626 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:01,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 10 times [2022-04-15 06:15:01,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:01,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151527687] [2022-04-15 06:15:01,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:01,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:01,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {2345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {2319#true} is VALID [2022-04-15 06:15:01,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:01,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-15 06:15:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 06:15:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:01,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:01,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:01,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:01,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} #68#return; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 06:15:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:15:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:01,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:01,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:01,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:01,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2334#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:01,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 06:15:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:01,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:01,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:01,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:01,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2339#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:01,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:01,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {2345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {2319#true} is VALID [2022-04-15 06:15:01,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:01,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-15 06:15:01,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-15 06:15:01,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2319#true} is VALID [2022-04-15 06:15:01,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2324#(= main_~i~0 0)} is VALID [2022-04-15 06:15:01,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {2324#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2324#(= main_~i~0 0)} is VALID [2022-04-15 06:15:01,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {2324#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:01,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:01,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:01,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2326#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:01,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2327#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:01,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {2327#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {2328#(<= main_~n~0 3)} is VALID [2022-04-15 06:15:01,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(<= main_~n~0 3)} ~i~1 := 0; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 06:15:01,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 06:15:01,767 INFO L272 TraceCheckUtils]: 16: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 06:15:01,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:01,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:01,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:01,769 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2319#true} {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} #68#return; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 06:15:01,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} havoc #t~mem5; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 06:15:01,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:01,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:01,770 INFO L272 TraceCheckUtils]: 24: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 06:15:01,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:01,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:01,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:01,771 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2319#true} {2334#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:01,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:01,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:01,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:01,772 INFO L272 TraceCheckUtils]: 32: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 06:15:01,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:01,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:01,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:01,773 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2319#true} {2339#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:01,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:01,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2344#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:01,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {2344#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2320#false} is VALID [2022-04-15 06:15:01,774 INFO L272 TraceCheckUtils]: 40: Hoare triple {2320#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#false} is VALID [2022-04-15 06:15:01,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-15 06:15:01,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-15 06:15:01,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-15 06:15:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:15:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:01,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151527687] [2022-04-15 06:15:01,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151527687] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:01,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252121864] [2022-04-15 06:15:01,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:15:01,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:01,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:01,776 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:01,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 06:15:01,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:15:01,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:01,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:15:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:01,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:02,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-15 06:15:02,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#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(9, 2); {2319#true} is VALID [2022-04-15 06:15:02,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:02,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-15 06:15:02,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-15 06:15:02,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2319#true} is VALID [2022-04-15 06:15:02,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2367#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:02,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2367#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:02,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:02,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:02,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:02,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2326#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:02,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2327#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:02,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {2327#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {2328#(<= main_~n~0 3)} is VALID [2022-04-15 06:15:02,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(<= main_~n~0 3)} ~i~1 := 0; {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,138 INFO L272 TraceCheckUtils]: 16: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 06:15:02,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:02,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:02,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:02,139 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2319#true} {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} #68#return; {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,141 INFO L272 TraceCheckUtils]: 24: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 06:15:02,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:02,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:02,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:02,142 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2319#true} {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} #68#return; {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,143 INFO L272 TraceCheckUtils]: 32: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 06:15:02,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:02,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:02,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:02,144 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2319#true} {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} #68#return; {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2467#(and (<= 3 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 06:15:02,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {2467#(and (<= 3 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2320#false} is VALID [2022-04-15 06:15:02,145 INFO L272 TraceCheckUtils]: 40: Hoare triple {2320#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#false} is VALID [2022-04-15 06:15:02,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-15 06:15:02,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-15 06:15:02,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-15 06:15:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:15:02,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:02,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-15 06:15:02,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-15 06:15:02,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-15 06:15:02,358 INFO L272 TraceCheckUtils]: 40: Hoare triple {2320#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#false} is VALID [2022-04-15 06:15:02,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {2344#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2320#false} is VALID [2022-04-15 06:15:02,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2344#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:02,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:02,362 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2319#true} {2339#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:02,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:02,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:02,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:02,363 INFO L272 TraceCheckUtils]: 32: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 06:15:02,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:02,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:02,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:02,364 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2319#true} {2334#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:02,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:02,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:02,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:02,365 INFO L272 TraceCheckUtils]: 24: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 06:15:02,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:02,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:02,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:02,367 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2319#true} {2546#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:02,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:02,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 06:15:02,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 06:15:02,367 INFO L272 TraceCheckUtils]: 16: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 06:15:02,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:02,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(<= main_~n~0 3)} ~i~1 := 0; {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:02,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {2327#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {2328#(<= main_~n~0 3)} is VALID [2022-04-15 06:15:02,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2327#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:02,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2326#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:02,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:02,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:02,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:02,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2367#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:02,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2367#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:02,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2319#true} is VALID [2022-04-15 06:15:02,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-15 06:15:02,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-15 06:15:02,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 06:15:02,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#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(9, 2); {2319#true} is VALID [2022-04-15 06:15:02,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-15 06:15:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:15:02,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252121864] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:02,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:02,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-04-15 06:15:02,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:02,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [644615401] [2022-04-15 06:15:02,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [644615401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:02,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:02,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:15:02,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723954543] [2022-04-15 06:15:02,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:02,374 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2022-04-15 06:15:02,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:02,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:02,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:02,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:15:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:15:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:15:02,407 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:02,908 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-15 06:15:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:15:02,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2022-04-15 06:15:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-15 06:15:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-15 06:15:02,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-15 06:15:02,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:02,969 INFO L225 Difference]: With dead ends: 74 [2022-04-15 06:15:02,969 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 06:15:02,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:15:02,971 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:02,971 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 51 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:15:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 06:15:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 06:15:02,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:02,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:02,997 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:02,997 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:02,999 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 06:15:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 06:15:02,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:02,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:03,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-15 06:15:03,001 INFO L87 Difference]: Start difference. First operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-15 06:15:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:03,003 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 06:15:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 06:15:03,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:03,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:03,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:03,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-04-15 06:15:03,006 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2022-04-15 06:15:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:03,006 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-04-15 06:15:03,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:03,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 50 transitions. [2022-04-15 06:15:03,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 06:15:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 06:15:03,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:03,064 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:03,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 06:15:03,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:03,280 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 11 times [2022-04-15 06:15:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:03,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716265388] [2022-04-15 06:15:03,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:03,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:03,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 12 times [2022-04-15 06:15:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:03,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417368738] [2022-04-15 06:15:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:03,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {3009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {2979#true} is VALID [2022-04-15 06:15:03,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 06:15:03,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-15 06:15:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 06:15:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:03,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 06:15:03,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 06:15:03,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 06:15:03,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 06:15:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:03,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 06:15:03,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 06:15:03,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 06:15:03,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:03,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 06:15:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:03,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 06:15:03,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 06:15:03,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 06:15:03,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:03,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {2979#true} call ULTIMATE.init(); {3009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:03,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {3009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {2979#true} is VALID [2022-04-15 06:15:03,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 06:15:03,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-15 06:15:03,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-15 06:15:03,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {2979#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2979#true} is VALID [2022-04-15 06:15:03,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {2979#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2984#(= main_~i~0 0)} is VALID [2022-04-15 06:15:03,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {2984#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2984#(= main_~i~0 0)} is VALID [2022-04-15 06:15:03,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {2984#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:03,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:03,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:03,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:03,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2987#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:03,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {2987#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2988#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:03,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {2988#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-15 06:15:03,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} assume !(~i~0 < ~n~0); {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-15 06:15:03,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} ~i~1 := 0; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:03,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:03,464 INFO L272 TraceCheckUtils]: 18: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2979#true} is VALID [2022-04-15 06:15:03,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 06:15:03,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 06:15:03,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 06:15:03,465 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2979#true} {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:03,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} havoc #t~mem5; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:03,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:03,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:03,466 INFO L272 TraceCheckUtils]: 26: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2979#true} is VALID [2022-04-15 06:15:03,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 06:15:03,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 06:15:03,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 06:15:03,467 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2979#true} {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:03,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:03,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:03,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:03,468 INFO L272 TraceCheckUtils]: 34: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2979#true} is VALID [2022-04-15 06:15:03,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 06:15:03,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 06:15:03,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 06:15:03,469 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2979#true} {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:03,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:03,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3005#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:03,470 INFO L290 TraceCheckUtils]: 41: Hoare triple {3005#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3006#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:03,470 INFO L272 TraceCheckUtils]: 42: Hoare triple {3006#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:15:03,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {3007#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3008#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:15:03,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {3008#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2980#false} is VALID [2022-04-15 06:15:03,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-15 06:15:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:15:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417368738] [2022-04-15 06:15:03,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417368738] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59956666] [2022-04-15 06:15:03,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:15:03,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:03,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:03,472 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-04-15 06:15:03,473 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-04-15 06:15:03,519 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:15:03,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:03,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:15:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:03,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:03,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:15:06,927 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:15:06,928 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 23 treesize of output 10 [2022-04-15 06:15:06,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {2979#true} call ULTIMATE.init(); {2979#true} is VALID [2022-04-15 06:15:06,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#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(9, 2); {2979#true} is VALID [2022-04-15 06:15:06,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 06:15:06,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-15 06:15:06,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-15 06:15:06,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {2979#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2979#true} is VALID [2022-04-15 06:15:06,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {2979#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3031#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:06,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {3031#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3031#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:06,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {3031#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3038#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:06,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {3038#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3038#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:06,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {3038#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3045#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:06,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {3045#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3045#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:06,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {3045#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3052#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:06,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {3052#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3056#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:06,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {3056#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3060#(exists ((v_main_~i~0_45 Int)) (and (<= main_~i~0 (+ v_main_~i~0_45 1)) (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0)))} is VALID [2022-04-15 06:15:07,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {3060#(exists ((v_main_~i~0_45 Int)) (and (<= main_~i~0 (+ v_main_~i~0_45 1)) (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0)))} assume !(~i~0 < ~n~0); {3064#(exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1))))} is VALID [2022-04-15 06:15:07,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {3064#(exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1))))} ~i~1 := 0; {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 06:15:07,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 06:15:07,008 INFO L272 TraceCheckUtils]: 18: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} ~cond := #in~cond; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume !(0 == ~cond); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume true; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,009 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #68#return; {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 06:15:07,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} havoc #t~mem5; {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 06:15:07,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 06:15:07,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 06:15:07,020 INFO L272 TraceCheckUtils]: 26: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} ~cond := #in~cond; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume !(0 == ~cond); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume true; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,021 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #68#return; {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 06:15:07,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} havoc #t~mem5; {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 06:15:07,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:07,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:07,029 INFO L272 TraceCheckUtils]: 34: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} ~cond := #in~cond; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume !(0 == ~cond); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume true; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 06:15:07,031 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} #68#return; {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:07,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:07,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3144#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:07,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {3144#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3006#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:07,033 INFO L272 TraceCheckUtils]: 42: Hoare triple {3006#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3151#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:15:07,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {3151#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3155#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:15:07,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {3155#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2980#false} is VALID [2022-04-15 06:15:07,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-15 06:15:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:15:07,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:07,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59956666] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:07,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:15:07,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-04-15 06:15:07,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:07,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716265388] [2022-04-15 06:15:07,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716265388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:07,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:07,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:15:07,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94258877] [2022-04-15 06:15:07,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:07,336 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-04-15 06:15:07,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:07,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:07,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:07,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:15:07,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:07,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:15:07,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:15:07,365 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:08,451 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-04-15 06:15:08,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:15:08,451 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-04-15 06:15:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-15 06:15:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-15 06:15:08,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-15 06:15:08,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:08,504 INFO L225 Difference]: With dead ends: 62 [2022-04-15 06:15:08,504 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 06:15:08,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=1859, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:15:08,505 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:08,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 76 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:15:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 06:15:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-15 06:15:08,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:08,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:08,537 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:08,537 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:08,539 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-15 06:15:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-15 06:15:08,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:08,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:08,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 06:15:08,539 INFO L87 Difference]: Start difference. First operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 06:15:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:08,540 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-15 06:15:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-15 06:15:08,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:08,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:08,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:08,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-04-15 06:15:08,542 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2022-04-15 06:15:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:08,542 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-04-15 06:15:08,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 06:15:08,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 58 transitions. [2022-04-15 06:15:08,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-15 06:15:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 06:15:08,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:08,599 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:08,617 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-04-15 06:15:08,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:08,804 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 13 times [2022-04-15 06:15:08,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:08,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002951339] [2022-04-15 06:15:08,806 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:08,806 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:08,806 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 14 times [2022-04-15 06:15:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:08,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731995271] [2022-04-15 06:15:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:08,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:08,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {3605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {3573#true} is VALID [2022-04-15 06:15:08,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-15 06:15:08,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 06:15:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:08,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:08,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:08,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} #68#return; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 06:15:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 06:15:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:08,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:08,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:08,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3589#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 06:15:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:08,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:08,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:08,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3594#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:08,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 06:15:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:08,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:08,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:08,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3599#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:08,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:08,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {3605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {3573#true} is VALID [2022-04-15 06:15:08,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-15 06:15:08,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-15 06:15:08,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3573#true} is VALID [2022-04-15 06:15:08,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3578#(= main_~i~0 0)} is VALID [2022-04-15 06:15:08,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {3578#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3578#(= main_~i~0 0)} is VALID [2022-04-15 06:15:08,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {3578#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3579#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:08,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3579#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:08,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3580#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:08,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3580#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:08,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {3580#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3581#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:08,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {3581#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3581#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:08,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {3581#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3582#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:08,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {3583#(<= main_~n~0 4)} is VALID [2022-04-15 06:15:08,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(<= main_~n~0 4)} ~i~1 := 0; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 06:15:08,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 06:15:08,981 INFO L272 TraceCheckUtils]: 18: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:08,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:08,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:08,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,981 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3573#true} {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} #68#return; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 06:15:08,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} havoc #t~mem5; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 06:15:08,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:08,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:08,982 INFO L272 TraceCheckUtils]: 26: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:08,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:08,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:08,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,983 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3589#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:08,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:08,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:08,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:08,984 INFO L272 TraceCheckUtils]: 34: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:08,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:08,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:08,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,986 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3573#true} {3594#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:08,986 INFO L290 TraceCheckUtils]: 39: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:08,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:08,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:08,987 INFO L272 TraceCheckUtils]: 42: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:08,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:08,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:08,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:08,987 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3573#true} {3599#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:08,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:08,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:08,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {3604#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3574#false} is VALID [2022-04-15 06:15:08,988 INFO L272 TraceCheckUtils]: 50: Hoare triple {3574#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3574#false} is VALID [2022-04-15 06:15:08,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-15 06:15:08,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-15 06:15:08,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-15 06:15:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 06:15:08,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:08,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731995271] [2022-04-15 06:15:08,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731995271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:08,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18309210] [2022-04-15 06:15:08,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:15:08,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:08,998 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-04-15 06:15:08,999 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-04-15 06:15:09,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:15:09,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:09,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:15:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:09,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:09,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-15 06:15:09,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#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(9, 2); {3573#true} is VALID [2022-04-15 06:15:09,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-15 06:15:09,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-15 06:15:09,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3573#true} is VALID [2022-04-15 06:15:09,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3627#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:09,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3627#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:09,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3579#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:09,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3579#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:09,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3580#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:09,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3580#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:09,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {3580#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3581#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:09,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {3581#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3581#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:09,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {3581#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3582#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:09,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {3583#(<= main_~n~0 4)} is VALID [2022-04-15 06:15:09,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(<= main_~n~0 4)} ~i~1 := 0; {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,352 INFO L272 TraceCheckUtils]: 18: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:09,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:09,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:09,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,353 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3573#true} {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} #68#return; {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,354 INFO L272 TraceCheckUtils]: 26: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:09,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:09,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:09,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,355 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} #68#return; {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,356 INFO L272 TraceCheckUtils]: 34: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:09,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:09,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:09,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,356 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3573#true} {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} #68#return; {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,372 INFO L272 TraceCheckUtils]: 42: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:09,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:09,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:09,372 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,373 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3573#true} {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} #68#return; {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3758#(and (<= 4 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 06:15:09,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {3758#(and (<= 4 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3574#false} is VALID [2022-04-15 06:15:09,374 INFO L272 TraceCheckUtils]: 50: Hoare triple {3574#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3574#false} is VALID [2022-04-15 06:15:09,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-15 06:15:09,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-15 06:15:09,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-15 06:15:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 06:15:09,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:09,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-15 06:15:09,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-15 06:15:09,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-15 06:15:09,613 INFO L272 TraceCheckUtils]: 50: Hoare triple {3574#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3574#false} is VALID [2022-04-15 06:15:09,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {3604#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3574#false} is VALID [2022-04-15 06:15:09,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:09,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:09,615 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3573#true} {3599#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:09,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:09,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:09,615 INFO L272 TraceCheckUtils]: 42: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:09,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:09,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:09,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:09,617 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3573#true} {3594#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:09,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:09,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:09,617 INFO L272 TraceCheckUtils]: 34: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:09,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:09,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:09,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:09,618 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3589#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:09,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:09,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:09,618 INFO L272 TraceCheckUtils]: 26: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:09,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:09,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:09,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:09,620 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3573#true} {3861#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:09,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 06:15:09,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 06:15:09,620 INFO L272 TraceCheckUtils]: 18: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 06:15:09,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:09,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(<= main_~n~0 4)} ~i~1 := 0; {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:09,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {3583#(<= main_~n~0 4)} is VALID [2022-04-15 06:15:09,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {3581#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3582#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:09,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {3581#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3581#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:09,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {3580#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3581#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:09,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3580#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:09,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3580#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:09,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3579#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:09,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3579#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:09,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3627#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:09,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3627#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:09,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3573#true} is VALID [2022-04-15 06:15:09,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-15 06:15:09,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-15 06:15:09,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 06:15:09,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#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(9, 2); {3573#true} is VALID [2022-04-15 06:15:09,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-15 06:15:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 06:15:09,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18309210] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:09,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:09,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-04-15 06:15:09,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:09,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002951339] [2022-04-15 06:15:09,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002951339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:09,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:09,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:15:09,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296602952] [2022-04-15 06:15:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:09,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 54 [2022-04-15 06:15:09,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:09,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:09,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:09,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:15:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:09,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:15:09,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:15:09,663 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:10,166 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-15 06:15:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:15:10,166 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 54 [2022-04-15 06:15:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-15 06:15:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-15 06:15:10,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-15 06:15:10,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:10,220 INFO L225 Difference]: With dead ends: 88 [2022-04-15 06:15:10,221 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 06:15:10,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:15:10,222 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:10,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 58 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:15:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 06:15:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-15 06:15:10,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:10,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:10,240 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:10,240 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:10,242 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-15 06:15:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-15 06:15:10,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:10,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:10,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 06:15:10,242 INFO L87 Difference]: Start difference. First operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 06:15:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:10,244 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-15 06:15:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-15 06:15:10,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:10,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:10,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:10,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-15 06:15:10,246 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2022-04-15 06:15:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:10,246 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-15 06:15:10,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:10,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-15 06:15:10,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 06:15:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 06:15:10,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:10,375 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:10,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 06:15:10,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 06:15:10,583 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:10,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 15 times [2022-04-15 06:15:10,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:10,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010149308] [2022-04-15 06:15:10,586 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:10,586 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:10,586 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:10,586 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 16 times [2022-04-15 06:15:10,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:10,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194741986] [2022-04-15 06:15:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:10,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:10,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:10,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {4408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {4372#true} is VALID [2022-04-15 06:15:10,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-15 06:15:10,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 06:15:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:10,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 06:15:10,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 06:15:10,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:10,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-15 06:15:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:10,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 06:15:10,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 06:15:10,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:10,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 06:15:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:10,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 06:15:10,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 06:15:10,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:10,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 06:15:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:10,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 06:15:10,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 06:15:10,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:10,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:10,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {4408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {4372#true} is VALID [2022-04-15 06:15:10,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-15 06:15:10,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-15 06:15:10,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {4372#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4372#true} is VALID [2022-04-15 06:15:10,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {4372#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4377#(= main_~i~0 0)} is VALID [2022-04-15 06:15:10,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {4377#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4377#(= main_~i~0 0)} is VALID [2022-04-15 06:15:10,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {4377#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:10,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:10,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:10,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:10,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:10,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:10,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4381#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:10,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {4381#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4382#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:10,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {4382#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-15 06:15:10,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !(~i~0 < ~n~0); {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-15 06:15:10,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} ~i~1 := 0; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:10,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:10,820 INFO L272 TraceCheckUtils]: 20: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-15 06:15:10,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 06:15:10,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 06:15:10,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,821 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4372#true} {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:10,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} havoc #t~mem5; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:10,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:10,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:10,822 INFO L272 TraceCheckUtils]: 28: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-15 06:15:10,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 06:15:10,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 06:15:10,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,823 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4372#true} {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:10,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:10,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:10,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:10,824 INFO L272 TraceCheckUtils]: 36: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-15 06:15:10,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 06:15:10,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 06:15:10,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,825 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4372#true} {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:10,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:10,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:10,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:10,826 INFO L272 TraceCheckUtils]: 44: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-15 06:15:10,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 06:15:10,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 06:15:10,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:10,826 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4372#true} {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:10,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:10,828 INFO L290 TraceCheckUtils]: 50: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4404#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:10,828 INFO L290 TraceCheckUtils]: 51: Hoare triple {4404#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4405#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:10,829 INFO L272 TraceCheckUtils]: 52: Hoare triple {4405#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:15:10,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {4406#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4407#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:15:10,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {4407#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4373#false} is VALID [2022-04-15 06:15:10,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-15 06:15:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 06:15:10,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:10,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194741986] [2022-04-15 06:15:10,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194741986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:10,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016870396] [2022-04-15 06:15:10,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:15:10,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:10,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:10,831 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:10,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 06:15:10,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:15:10,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:10,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:15:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:10,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:11,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:15:14,292 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:15:14,293 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 23 treesize of output 10 [2022-04-15 06:15:14,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2022-04-15 06:15:14,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#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(9, 2); {4372#true} is VALID [2022-04-15 06:15:14,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 06:15:14,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-15 06:15:14,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-15 06:15:14,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {4372#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4372#true} is VALID [2022-04-15 06:15:14,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {4372#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4430#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:14,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {4430#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4430#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:14,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {4430#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4437#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:14,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {4437#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4437#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:14,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {4437#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4444#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:14,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {4444#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4444#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:14,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {4444#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4451#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:14,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {4451#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4451#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:14,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {4451#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4458#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:14,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {4458#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4462#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4))} is VALID [2022-04-15 06:15:14,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {4462#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4466#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~i~0 (+ v_main_~i~0_63 1))))} is VALID [2022-04-15 06:15:14,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {4466#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~i~0 (+ v_main_~i~0_63 1))))} assume !(~i~0 < ~n~0); {4470#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1))))} is VALID [2022-04-15 06:15:14,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {4470#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1))))} ~i~1 := 0; {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,372 INFO L272 TraceCheckUtils]: 20: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,373 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #68#return; {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} havoc #t~mem5; {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,377 INFO L272 TraceCheckUtils]: 28: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,378 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #68#return; {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} havoc #t~mem5; {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,386 INFO L272 TraceCheckUtils]: 36: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,388 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #68#return; {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} havoc #t~mem5; {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:14,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:14,393 INFO L272 TraceCheckUtils]: 44: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 06:15:14,395 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} #68#return; {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:14,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:14,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4575#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 06:15:14,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {4575#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4405#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:14,397 INFO L272 TraceCheckUtils]: 52: Hoare triple {4405#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:15:14,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {4582#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:15:14,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {4586#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4373#false} is VALID [2022-04-15 06:15:14,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-15 06:15:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 06:15:14,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:14,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016870396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:14,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:15:14,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2022-04-15 06:15:14,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:14,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010149308] [2022-04-15 06:15:14,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010149308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:14,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:14,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:15:14,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321700542] [2022-04-15 06:15:14,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 56 [2022-04-15 06:15:14,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:14,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:14,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:14,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:15:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:14,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:15:14,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:15:14,711 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:16,076 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-04-15 06:15:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:15:16,076 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 56 [2022-04-15 06:15:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-15 06:15:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-15 06:15:16,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 61 transitions. [2022-04-15 06:15:16,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:16,132 INFO L225 Difference]: With dead ends: 72 [2022-04-15 06:15:16,132 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 06:15:16,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=251, Invalid=2401, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:15:16,133 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:16,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 87 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:15:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 06:15:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-04-15 06:15:16,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:16,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:16,156 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:16,157 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:16,158 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 06:15:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 06:15:16,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:16,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:16,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-15 06:15:16,158 INFO L87 Difference]: Start difference. First operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-15 06:15:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:16,159 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 06:15:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 06:15:16,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:16,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:16,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:16,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-15 06:15:16,160 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2022-04-15 06:15:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:16,160 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-15 06:15:16,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 06:15:16,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-15 06:15:16,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-15 06:15:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 06:15:16,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:16,246 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:16,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 06:15:16,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 06:15:16,447 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 17 times [2022-04-15 06:15:16,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:16,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008028507] [2022-04-15 06:15:16,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:16,450 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:16,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 18 times [2022-04-15 06:15:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:16,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685353746] [2022-04-15 06:15:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:16,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:16,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {5106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {5068#true} is VALID [2022-04-15 06:15:16,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-15 06:15:16,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 06:15:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:16,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} #68#return; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 06:15:16,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-15 06:15:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:16,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5085#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 06:15:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:16,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5090#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 06:15:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:16,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5095#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 06:15:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:16,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5100#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:16,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:16,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {5106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {5068#true} is VALID [2022-04-15 06:15:16,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-15 06:15:16,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-15 06:15:16,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {5068#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5068#true} is VALID [2022-04-15 06:15:16,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {5068#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5073#(= main_~i~0 0)} is VALID [2022-04-15 06:15:16,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {5073#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5073#(= main_~i~0 0)} is VALID [2022-04-15 06:15:16,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {5073#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5074#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:16,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:16,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5075#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:16,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:16,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5076#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:16,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {5076#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:16,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {5076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5077#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:16,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {5077#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:16,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5078#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:16,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {5079#(<= main_~n~0 5)} is VALID [2022-04-15 06:15:16,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= main_~n~0 5)} ~i~1 := 0; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 06:15:16,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 06:15:16,623 INFO L272 TraceCheckUtils]: 20: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:16,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,624 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5068#true} {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} #68#return; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 06:15:16,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} havoc #t~mem5; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 06:15:16,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:16,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:16,625 INFO L272 TraceCheckUtils]: 28: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:16,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,625 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5068#true} {5085#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:16,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:16,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:16,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:16,626 INFO L272 TraceCheckUtils]: 36: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:16,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,627 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5068#true} {5090#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:16,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:16,628 INFO L290 TraceCheckUtils]: 42: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:16,628 INFO L290 TraceCheckUtils]: 43: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:16,628 INFO L272 TraceCheckUtils]: 44: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:16,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,629 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5068#true} {5095#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:16,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:16,629 INFO L290 TraceCheckUtils]: 50: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:16,629 INFO L290 TraceCheckUtils]: 51: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:16,630 INFO L272 TraceCheckUtils]: 52: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:16,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:16,630 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:16,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:16,630 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5068#true} {5100#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:16,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:16,631 INFO L290 TraceCheckUtils]: 58: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5105#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:16,631 INFO L290 TraceCheckUtils]: 59: Hoare triple {5105#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5069#false} is VALID [2022-04-15 06:15:16,631 INFO L272 TraceCheckUtils]: 60: Hoare triple {5069#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5069#false} is VALID [2022-04-15 06:15:16,631 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-15 06:15:16,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-15 06:15:16,631 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-15 06:15:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 06:15:16,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:16,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685353746] [2022-04-15 06:15:16,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685353746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:16,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449426414] [2022-04-15 06:15:16,632 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:15:16,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:16,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:16,633 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:16,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 06:15:16,687 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 06:15:16,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:16,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:15:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:16,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:17,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-15 06:15:17,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#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(9, 2); {5068#true} is VALID [2022-04-15 06:15:17,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-15 06:15:17,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-15 06:15:17,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {5068#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5068#true} is VALID [2022-04-15 06:15:17,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {5068#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5128#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:17,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {5128#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5128#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:17,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {5128#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5074#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:17,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:17,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5075#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:17,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:17,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5076#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:17,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {5076#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:17,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {5076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5077#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:17,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {5077#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:17,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5078#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:17,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {5079#(<= main_~n~0 5)} is VALID [2022-04-15 06:15:17,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= main_~n~0 5)} ~i~1 := 0; {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 06:15:17,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 06:15:17,152 INFO L272 TraceCheckUtils]: 20: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,152 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5068#true} {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} #68#return; {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 06:15:17,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} havoc #t~mem5; {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 06:15:17,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 06:15:17,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 06:15:17,153 INFO L272 TraceCheckUtils]: 28: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,154 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5068#true} {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} #68#return; {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 06:15:17,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} havoc #t~mem5; {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 06:15:17,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:17,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:17,155 INFO L272 TraceCheckUtils]: 36: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,156 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5068#true} {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} #68#return; {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:17,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} havoc #t~mem5; {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:17,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:17,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:17,157 INFO L272 TraceCheckUtils]: 44: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,157 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,171 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5068#true} {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} #68#return; {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:17,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} havoc #t~mem5; {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:17,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:17,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:17,173 INFO L272 TraceCheckUtils]: 52: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,173 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,173 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5068#true} {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} #68#return; {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:17,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} havoc #t~mem5; {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:17,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5290#(and (<= 5 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 06:15:17,174 INFO L290 TraceCheckUtils]: 59: Hoare triple {5290#(and (<= 5 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5069#false} is VALID [2022-04-15 06:15:17,174 INFO L272 TraceCheckUtils]: 60: Hoare triple {5069#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5069#false} is VALID [2022-04-15 06:15:17,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-15 06:15:17,175 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-15 06:15:17,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-15 06:15:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 06:15:17,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:17,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-15 06:15:17,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-15 06:15:17,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-15 06:15:17,426 INFO L272 TraceCheckUtils]: 60: Hoare triple {5069#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5069#false} is VALID [2022-04-15 06:15:17,426 INFO L290 TraceCheckUtils]: 59: Hoare triple {5105#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5069#false} is VALID [2022-04-15 06:15:17,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5105#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:17,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:17,428 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5068#true} {5100#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:17,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,428 INFO L272 TraceCheckUtils]: 52: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:17,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:17,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:17,429 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5068#true} {5095#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:17,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,430 INFO L272 TraceCheckUtils]: 44: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:17,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:17,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:17,431 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5068#true} {5090#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:17,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,431 INFO L272 TraceCheckUtils]: 36: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:17,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:17,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:17,433 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5068#true} {5085#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:17,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,433 INFO L272 TraceCheckUtils]: 28: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:17,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:17,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:17,453 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5068#true} {5417#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:17,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 06:15:17,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 06:15:17,453 INFO L272 TraceCheckUtils]: 20: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 06:15:17,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:17,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= main_~n~0 5)} ~i~1 := 0; {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:17,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {5079#(<= main_~n~0 5)} is VALID [2022-04-15 06:15:17,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5078#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:17,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {5077#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:17,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {5076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5077#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:17,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {5076#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:17,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5076#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:17,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:17,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5075#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:17,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:17,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {5128#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5074#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:17,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {5128#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5128#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:17,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {5068#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5128#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:17,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {5068#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5068#true} is VALID [2022-04-15 06:15:17,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-15 06:15:17,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-15 06:15:17,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 06:15:17,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#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(9, 2); {5068#true} is VALID [2022-04-15 06:15:17,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-15 06:15:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 06:15:17,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449426414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:17,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-04-15 06:15:17,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:17,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008028507] [2022-04-15 06:15:17,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008028507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:17,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:15:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806934298] [2022-04-15 06:15:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-04-15 06:15:17,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:17,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:17,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:17,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:15:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:17,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:15:17,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:15:17,493 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:18,096 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-15 06:15:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:15:18,096 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-04-15 06:15:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-15 06:15:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-15 06:15:18,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-15 06:15:18,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:18,161 INFO L225 Difference]: With dead ends: 102 [2022-04-15 06:15:18,161 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 06:15:18,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 06:15:18,162 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:18,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:15:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 06:15:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-15 06:15:18,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:18,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:18,183 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:18,183 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:18,184 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 06:15:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 06:15:18,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:18,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:18,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-15 06:15:18,185 INFO L87 Difference]: Start difference. First operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-15 06:15:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:18,185 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 06:15:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 06:15:18,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:18,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:18,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:18,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-15 06:15:18,187 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2022-04-15 06:15:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:18,187 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-15 06:15:18,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:18,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-15 06:15:18,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 06:15:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 06:15:18,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:18,269 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:18,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:18,470 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 06:15:18,470 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 19 times [2022-04-15 06:15:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:18,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1332257848] [2022-04-15 06:15:18,472 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:18,472 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:18,472 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 20 times [2022-04-15 06:15:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:18,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112251393] [2022-04-15 06:15:18,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:18,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {6048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {6006#true} is VALID [2022-04-15 06:15:18,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-15 06:15:18,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 06:15:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:18,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:18,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 06:15:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:18,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:18,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:15:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:18,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:18,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 06:15:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:18,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:18,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 06:15:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:18,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:18,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:18,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {6048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {6006#true} is VALID [2022-04-15 06:15:18,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-15 06:15:18,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-15 06:15:18,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {6006#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6006#true} is VALID [2022-04-15 06:15:18,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {6006#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6011#(= main_~i~0 0)} is VALID [2022-04-15 06:15:18,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {6011#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6011#(= main_~i~0 0)} is VALID [2022-04-15 06:15:18,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {6011#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:18,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:18,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:18,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:18,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:18,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:18,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:18,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:18,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6016#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:15:18,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {6016#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6017#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:15:18,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {6017#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-15 06:15:18,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-15 06:15:18,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:18,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:18,737 INFO L272 TraceCheckUtils]: 22: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 06:15:18,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,738 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6006#true} {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:18,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} havoc #t~mem5; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:18,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:18,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:18,739 INFO L272 TraceCheckUtils]: 30: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 06:15:18,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,740 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6006#true} {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:18,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:18,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:18,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:18,741 INFO L272 TraceCheckUtils]: 38: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 06:15:18,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,742 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6006#true} {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:18,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:18,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:18,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:18,743 INFO L272 TraceCheckUtils]: 46: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 06:15:18,743 INFO L290 TraceCheckUtils]: 47: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,743 INFO L290 TraceCheckUtils]: 48: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,743 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6006#true} {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:18,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:18,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:18,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:18,744 INFO L272 TraceCheckUtils]: 54: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 06:15:18,745 INFO L290 TraceCheckUtils]: 55: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 06:15:18,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 06:15:18,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:18,745 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6006#true} {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:18,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:18,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6044#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:18,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {6044#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6045#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:18,746 INFO L272 TraceCheckUtils]: 62: Hoare triple {6045#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6046#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:15:18,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {6046#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6047#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:15:18,747 INFO L290 TraceCheckUtils]: 64: Hoare triple {6047#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6007#false} is VALID [2022-04-15 06:15:18,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-15 06:15:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 06:15:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:18,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112251393] [2022-04-15 06:15:18,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112251393] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:18,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903446870] [2022-04-15 06:15:18,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:15:18,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:18,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:18,749 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:18,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 06:15:18,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:15:18,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:18,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:15:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:18,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:18,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:15:22,915 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:15:22,915 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 23 treesize of output 10 [2022-04-15 06:15:23,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2022-04-15 06:15:23,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#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(9, 2); {6006#true} is VALID [2022-04-15 06:15:23,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 06:15:23,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-15 06:15:23,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-15 06:15:23,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {6006#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6006#true} is VALID [2022-04-15 06:15:23,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {6006#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6070#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:23,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6070#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:23,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {6070#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6077#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:23,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {6077#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6077#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:23,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {6077#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6084#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:23,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {6084#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6084#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:23,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {6084#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6091#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:23,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6091#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:23,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {6091#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6098#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:23,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {6098#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6098#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:23,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {6098#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6105#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:23,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {6105#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6109#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5))} is VALID [2022-04-15 06:15:23,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {6109#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6113#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~i~0 (+ v_main_~i~0_84 1))))} is VALID [2022-04-15 06:15:23,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {6113#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~i~0 (+ v_main_~i~0_84 1))))} assume !(~i~0 < ~n~0); {6117#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1))))} is VALID [2022-04-15 06:15:23,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {6117#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1))))} ~i~1 := 0; {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 06:15:23,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 06:15:23,027 INFO L272 TraceCheckUtils]: 22: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,029 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #68#return; {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 06:15:23,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} havoc #t~mem5; {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 06:15:23,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 06:15:23,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 06:15:23,034 INFO L272 TraceCheckUtils]: 30: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,036 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #68#return; {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 06:15:23,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} havoc #t~mem5; {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 06:15:23,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:23,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:23,042 INFO L272 TraceCheckUtils]: 38: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,043 INFO L290 TraceCheckUtils]: 40: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,044 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} #68#return; {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:23,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:23,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:23,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:23,050 INFO L272 TraceCheckUtils]: 46: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,052 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} #68#return; {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:23,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:23,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:23,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:23,056 INFO L272 TraceCheckUtils]: 54: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 06:15:23,057 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} #68#return; {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:23,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} havoc #t~mem5; {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:23,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6247#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:23,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {6247#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6045#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:23,059 INFO L272 TraceCheckUtils]: 62: Hoare triple {6045#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:15:23,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {6254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:15:23,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {6258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6007#false} is VALID [2022-04-15 06:15:23,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-15 06:15:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 06:15:23,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:23,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903446870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:23,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:15:23,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2022-04-15 06:15:23,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:23,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1332257848] [2022-04-15 06:15:23,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1332257848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:23,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:23,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:15:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105948417] [2022-04-15 06:15:23,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:23,539 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2022-04-15 06:15:23,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:23,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:23,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:23,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:15:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:15:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:15:23,579 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:25,126 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-15 06:15:25,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:15:25,126 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2022-04-15 06:15:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-15 06:15:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-15 06:15:25,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2022-04-15 06:15:25,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:25,187 INFO L225 Difference]: With dead ends: 82 [2022-04-15 06:15:25,187 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 06:15:25,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=295, Invalid=3011, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:15:25,189 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:25,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 98 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:15:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 06:15:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-04-15 06:15:25,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:25,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:25,217 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:25,217 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:25,218 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 06:15:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 06:15:25,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:25,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:25,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-15 06:15:25,219 INFO L87 Difference]: Start difference. First operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-15 06:15:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:25,220 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 06:15:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 06:15:25,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:25,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:25,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:25,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-15 06:15:25,221 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 66 [2022-04-15 06:15:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:25,221 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-15 06:15:25,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 06:15:25,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-15 06:15:25,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 06:15:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 06:15:25,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:25,304 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:25,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:25,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 06:15:25,511 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 21 times [2022-04-15 06:15:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:25,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022346634] [2022-04-15 06:15:25,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:25,514 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:25,514 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 22 times [2022-04-15 06:15:25,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:25,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288704140] [2022-04-15 06:15:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:25,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:25,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {6848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {6804#true} is VALID [2022-04-15 06:15:25,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-15 06:15:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 06:15:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:25,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} #68#return; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 06:15:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 06:15:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:25,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6822#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:25,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:15:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:25,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6827#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:25,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 06:15:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:25,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6832#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:25,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 06:15:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:25,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6837#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:25,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 06:15:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:25,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6842#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:25,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:25,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {6848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {6804#true} is VALID [2022-04-15 06:15:25,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-15 06:15:25,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-15 06:15:25,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6804#true} is VALID [2022-04-15 06:15:25,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6809#(= main_~i~0 0)} is VALID [2022-04-15 06:15:25,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6809#(= main_~i~0 0)} is VALID [2022-04-15 06:15:25,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6810#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:25,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6810#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:25,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6811#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:25,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {6811#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6811#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:25,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {6811#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6812#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:25,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6812#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:25,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6813#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:25,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6813#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:25,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6814#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:25,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6814#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:25,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6815#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:25,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {6816#(<= main_~n~0 6)} is VALID [2022-04-15 06:15:25,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(<= main_~n~0 6)} ~i~1 := 0; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 06:15:25,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 06:15:25,729 INFO L272 TraceCheckUtils]: 22: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:25,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,730 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6804#true} {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} #68#return; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 06:15:25,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} havoc #t~mem5; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 06:15:25,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:25,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:25,731 INFO L272 TraceCheckUtils]: 30: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:25,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,731 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6804#true} {6822#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:25,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:25,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:25,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:25,732 INFO L272 TraceCheckUtils]: 38: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:25,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,733 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6804#true} {6827#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:25,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:25,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:25,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:25,734 INFO L272 TraceCheckUtils]: 46: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:25,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,735 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6804#true} {6832#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:25,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:25,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:25,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:25,736 INFO L272 TraceCheckUtils]: 54: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:25,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,736 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6804#true} {6837#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:25,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:25,737 INFO L290 TraceCheckUtils]: 60: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:25,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:25,737 INFO L272 TraceCheckUtils]: 62: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:25,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:25,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:25,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:25,738 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6804#true} {6842#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:25,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:25,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6847#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:25,739 INFO L290 TraceCheckUtils]: 69: Hoare triple {6847#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6805#false} is VALID [2022-04-15 06:15:25,739 INFO L272 TraceCheckUtils]: 70: Hoare triple {6805#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6805#false} is VALID [2022-04-15 06:15:25,739 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-15 06:15:25,739 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-15 06:15:25,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-15 06:15:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 63 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 06:15:25,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:25,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288704140] [2022-04-15 06:15:25,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288704140] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:25,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913196303] [2022-04-15 06:15:25,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:15:25,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:25,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:25,741 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:25,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 06:15:25,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:15:25,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:25,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:15:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:25,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:26,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-15 06:15:26,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#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(9, 2); {6804#true} is VALID [2022-04-15 06:15:26,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-15 06:15:26,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-15 06:15:26,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6804#true} is VALID [2022-04-15 06:15:26,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6870#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:26,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {6870#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6870#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:26,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {6870#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6810#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:26,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6810#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:26,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6811#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:26,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {6811#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6811#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:26,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {6811#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6812#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:26,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6812#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:26,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6813#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:26,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6813#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:26,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6814#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:26,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6814#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:26,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6815#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:26,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {6816#(<= main_~n~0 6)} is VALID [2022-04-15 06:15:26,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(<= main_~n~0 6)} ~i~1 := 0; {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-15 06:15:26,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-15 06:15:26,269 INFO L272 TraceCheckUtils]: 22: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,269 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6804#true} {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} #68#return; {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-15 06:15:26,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} havoc #t~mem5; {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-15 06:15:26,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-15 06:15:26,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-15 06:15:26,270 INFO L272 TraceCheckUtils]: 30: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,271 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6804#true} {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} #68#return; {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-15 06:15:26,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} havoc #t~mem5; {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-15 06:15:26,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:26,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:26,272 INFO L272 TraceCheckUtils]: 38: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,273 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6804#true} {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} #68#return; {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:26,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} havoc #t~mem5; {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:26,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:26,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:26,283 INFO L272 TraceCheckUtils]: 46: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,284 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6804#true} {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} #68#return; {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:26,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} havoc #t~mem5; {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:26,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:26,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:26,285 INFO L272 TraceCheckUtils]: 54: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,285 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,286 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6804#true} {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} #68#return; {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:26,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} havoc #t~mem5; {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:26,286 INFO L290 TraceCheckUtils]: 60: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:26,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:26,287 INFO L272 TraceCheckUtils]: 62: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,287 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,287 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6804#true} {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} #68#return; {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:26,288 INFO L290 TraceCheckUtils]: 67: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} havoc #t~mem5; {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:26,288 INFO L290 TraceCheckUtils]: 68: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7063#(and (<= main_~n~0 6) (<= 6 main_~i~1))} is VALID [2022-04-15 06:15:26,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {7063#(and (<= main_~n~0 6) (<= 6 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6805#false} is VALID [2022-04-15 06:15:26,289 INFO L272 TraceCheckUtils]: 70: Hoare triple {6805#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6805#false} is VALID [2022-04-15 06:15:26,289 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-15 06:15:26,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-15 06:15:26,289 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-15 06:15:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 06:15:26,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:26,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-15 06:15:26,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-15 06:15:26,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-15 06:15:26,603 INFO L272 TraceCheckUtils]: 70: Hoare triple {6805#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6805#false} is VALID [2022-04-15 06:15:26,603 INFO L290 TraceCheckUtils]: 69: Hoare triple {6847#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6805#false} is VALID [2022-04-15 06:15:26,604 INFO L290 TraceCheckUtils]: 68: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6847#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:26,604 INFO L290 TraceCheckUtils]: 67: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:26,604 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6804#true} {6842#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:26,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,605 INFO L272 TraceCheckUtils]: 62: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:26,605 INFO L290 TraceCheckUtils]: 60: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:26,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:26,606 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6804#true} {6837#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:26,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,606 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,606 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,606 INFO L272 TraceCheckUtils]: 54: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:26,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:26,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:26,608 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6804#true} {6832#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:26,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,608 INFO L272 TraceCheckUtils]: 46: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:26,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:26,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:26,609 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6804#true} {6827#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:26,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,609 INFO L272 TraceCheckUtils]: 38: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:26,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:26,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:26,611 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6804#true} {6822#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:26,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,611 INFO L272 TraceCheckUtils]: 30: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:26,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:26,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:26,614 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6804#true} {7214#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:26,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 06:15:26,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 06:15:26,615 INFO L272 TraceCheckUtils]: 22: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 06:15:26,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:26,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(<= main_~n~0 6)} ~i~1 := 0; {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:26,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {6816#(<= main_~n~0 6)} is VALID [2022-04-15 06:15:26,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6815#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:26,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6814#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:26,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6814#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:26,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6813#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:26,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6813#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:26,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6812#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:26,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {6811#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6812#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:26,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {6811#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6811#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:26,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6811#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:26,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6810#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:26,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {6870#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6810#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:26,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {6870#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6870#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:26,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6870#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:26,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6804#true} is VALID [2022-04-15 06:15:26,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-15 06:15:26,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-15 06:15:26,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 06:15:26,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#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(9, 2); {6804#true} is VALID [2022-04-15 06:15:26,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-15 06:15:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 06:15:26,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913196303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:26,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-04-15 06:15:26,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:26,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022346634] [2022-04-15 06:15:26,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022346634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:26,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:26,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:15:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184480166] [2022-04-15 06:15:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:26,623 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 74 [2022-04-15 06:15:26,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:26,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:26,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:26,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:15:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:15:26,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:15:26,658 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:27,343 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-04-15 06:15:27,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:15:27,343 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 74 [2022-04-15 06:15:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-15 06:15:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-15 06:15:27,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2022-04-15 06:15:27,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:27,421 INFO L225 Difference]: With dead ends: 116 [2022-04-15 06:15:27,421 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 06:15:27,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=1392, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:15:27,424 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:27,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 62 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:15:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 06:15:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-15 06:15:27,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:27,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:27,452 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:27,453 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:27,454 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 06:15:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 06:15:27,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:27,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:27,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-15 06:15:27,454 INFO L87 Difference]: Start difference. First operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-15 06:15:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:27,455 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 06:15:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 06:15:27,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:27,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:27,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:27,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-15 06:15:27,457 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-15 06:15:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:27,457 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-15 06:15:27,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:27,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-15 06:15:27,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 06:15:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 06:15:27,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:27,550 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:27,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:27,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 06:15:27,759 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 23 times [2022-04-15 06:15:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:27,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480645493] [2022-04-15 06:15:27,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:27,762 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:27,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 24 times [2022-04-15 06:15:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:27,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824627326] [2022-04-15 06:15:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:28,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:28,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {7929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {7881#true} is VALID [2022-04-15 06:15:28,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-15 06:15:28,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:15:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:28,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 06:15:28,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 06:15:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:28,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:28,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 06:15:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:28,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:28,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:15:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:28,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:28,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 06:15:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:28,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:28,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 06:15:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:28,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:28,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {7881#true} call ULTIMATE.init(); {7929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:28,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {7881#true} is VALID [2022-04-15 06:15:28,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-15 06:15:28,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-15 06:15:28,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {7881#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7881#true} is VALID [2022-04-15 06:15:28,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {7881#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {7886#(= main_~i~0 0)} is VALID [2022-04-15 06:15:28,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {7886#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7886#(= main_~i~0 0)} is VALID [2022-04-15 06:15:28,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {7886#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:28,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:28,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:28,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:28,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:28,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:28,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:28,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:28,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:15:28,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:15:28,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7892#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:15:28,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {7892#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7893#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:15:28,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {7893#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-15 06:15:28,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} assume !(~i~0 < ~n~0); {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-15 06:15:28,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} ~i~1 := 0; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 06:15:28,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 06:15:28,075 INFO L272 TraceCheckUtils]: 24: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 06:15:28,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,076 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7881#true} {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 06:15:28,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 06:15:28,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:28,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:28,077 INFO L272 TraceCheckUtils]: 32: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 06:15:28,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,078 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7881#true} {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:28,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:28,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:28,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:28,079 INFO L272 TraceCheckUtils]: 40: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 06:15:28,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,080 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7881#true} {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:28,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:28,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:28,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:28,081 INFO L272 TraceCheckUtils]: 48: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 06:15:28,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,081 INFO L290 TraceCheckUtils]: 50: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,082 INFO L290 TraceCheckUtils]: 51: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,082 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7881#true} {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:28,082 INFO L290 TraceCheckUtils]: 53: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:28,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:28,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:28,083 INFO L272 TraceCheckUtils]: 56: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 06:15:28,083 INFO L290 TraceCheckUtils]: 57: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,083 INFO L290 TraceCheckUtils]: 58: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,083 INFO L290 TraceCheckUtils]: 59: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,084 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7881#true} {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:28,084 INFO L290 TraceCheckUtils]: 61: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:28,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:28,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:28,085 INFO L272 TraceCheckUtils]: 64: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 06:15:28,086 INFO L290 TraceCheckUtils]: 65: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 06:15:28,086 INFO L290 TraceCheckUtils]: 66: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 06:15:28,086 INFO L290 TraceCheckUtils]: 67: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:28,086 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7881#true} {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:28,087 INFO L290 TraceCheckUtils]: 69: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:28,087 INFO L290 TraceCheckUtils]: 70: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7925#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:28,087 INFO L290 TraceCheckUtils]: 71: Hoare triple {7925#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7926#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:28,088 INFO L272 TraceCheckUtils]: 72: Hoare triple {7926#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:15:28,088 INFO L290 TraceCheckUtils]: 73: Hoare triple {7927#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7928#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:15:28,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {7928#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7882#false} is VALID [2022-04-15 06:15:28,089 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-15 06:15:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 06:15:28,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:28,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824627326] [2022-04-15 06:15:28,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824627326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:28,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684348996] [2022-04-15 06:15:28,089 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:15:28,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:28,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:28,090 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:28,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 06:15:28,162 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 06:15:28,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:28,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 06:15:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:28,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:28,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:15:33,029 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:15:33,030 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 23 treesize of output 10 [2022-04-15 06:15:33,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {7881#true} call ULTIMATE.init(); {7881#true} is VALID [2022-04-15 06:15:33,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#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(9, 2); {7881#true} is VALID [2022-04-15 06:15:33,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 06:15:33,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-15 06:15:33,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-15 06:15:33,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {7881#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7881#true} is VALID [2022-04-15 06:15:33,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {7881#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {7951#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:33,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {7951#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7951#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:33,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {7951#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7958#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:33,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {7958#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7958#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:33,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {7958#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7965#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:33,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {7965#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:33,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {7965#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7972#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:33,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {7972#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:33,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {7972#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7979#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:33,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {7979#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7979#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:33,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {7979#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7986#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:33,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {7986#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7986#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:33,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {7986#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7993#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:33,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {7993#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7997#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6))} is VALID [2022-04-15 06:15:33,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {7997#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8001#(exists ((v_main_~i~0_108 Int)) (and (<= main_~i~0 (+ v_main_~i~0_108 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= v_main_~i~0_108 6)))} is VALID [2022-04-15 06:15:33,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {8001#(exists ((v_main_~i~0_108 Int)) (and (<= main_~i~0 (+ v_main_~i~0_108 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= v_main_~i~0_108 6)))} assume !(~i~0 < ~n~0); {8005#(exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6)))} is VALID [2022-04-15 06:15:33,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {8005#(exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6)))} ~i~1 := 0; {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:15:33,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:15:33,137 INFO L272 TraceCheckUtils]: 24: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,143 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} #68#return; {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:15:33,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} havoc #t~mem5; {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:15:33,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 06:15:33,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 06:15:33,147 INFO L272 TraceCheckUtils]: 32: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,155 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} #68#return; {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 06:15:33,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} havoc #t~mem5; {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 06:15:33,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:33,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:33,162 INFO L272 TraceCheckUtils]: 40: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,189 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} #68#return; {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:33,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} havoc #t~mem5; {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:33,189 INFO L290 TraceCheckUtils]: 46: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:33,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:33,192 INFO L272 TraceCheckUtils]: 48: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,194 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} #68#return; {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:33,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} havoc #t~mem5; {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:33,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:33,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:33,197 INFO L272 TraceCheckUtils]: 56: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,201 INFO L290 TraceCheckUtils]: 59: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,202 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} #68#return; {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:33,202 INFO L290 TraceCheckUtils]: 61: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} havoc #t~mem5; {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:33,203 INFO L290 TraceCheckUtils]: 62: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:33,203 INFO L290 TraceCheckUtils]: 63: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:33,207 INFO L272 TraceCheckUtils]: 64: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 06:15:33,209 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} #68#return; {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:33,209 INFO L290 TraceCheckUtils]: 69: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} havoc #t~mem5; {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:33,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8160#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 06:15:33,210 INFO L290 TraceCheckUtils]: 71: Hoare triple {8160#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7926#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:33,211 INFO L272 TraceCheckUtils]: 72: Hoare triple {7926#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8167#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:15:33,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {8167#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8171#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:15:33,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {8171#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7882#false} is VALID [2022-04-15 06:15:33,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-15 06:15:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 66 proven. 67 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 06:15:33,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:33,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684348996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:33,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:15:33,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-04-15 06:15:33,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480645493] [2022-04-15 06:15:33,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480645493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:33,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:33,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:15:33,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072716365] [2022-04-15 06:15:33,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:33,486 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 76 [2022-04-15 06:15:33,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:33,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:33,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:33,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:15:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:15:33,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1697, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:15:33,539 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:35,608 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-15 06:15:35,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:15:35,609 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 76 [2022-04-15 06:15:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-15 06:15:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-15 06:15:35,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-15 06:15:35,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:35,695 INFO L225 Difference]: With dead ends: 92 [2022-04-15 06:15:35,696 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 06:15:35,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=343, Invalid=3689, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:15:35,697 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:35,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 113 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:15:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 06:15:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-04-15 06:15:35,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:35,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:35,729 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:35,729 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:35,730 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-15 06:15:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-15 06:15:35,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:35,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:35,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-15 06:15:35,730 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-15 06:15:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:35,733 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-15 06:15:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-15 06:15:35,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:35,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:35,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:35,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-15 06:15:35,734 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 76 [2022-04-15 06:15:35,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:35,735 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-15 06:15:35,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 06:15:35,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-15 06:15:35,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-15 06:15:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 06:15:35,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:35,846 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:35,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:36,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 06:15:36,053 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 25 times [2022-04-15 06:15:36,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:36,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42809977] [2022-04-15 06:15:36,056 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:36,056 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:36,056 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 26 times [2022-04-15 06:15:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:36,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965202947] [2022-04-15 06:15:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {8831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {8781#true} is VALID [2022-04-15 06:15:36,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-15 06:15:36,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 06:15:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} #68#return; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 06:15:36,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 06:15:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8800#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 06:15:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8805#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:36,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:15:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8810#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 06:15:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8815#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 06:15:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8820#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:15:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8825#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:36,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:36,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {8831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {8781#true} is VALID [2022-04-15 06:15:36,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-15 06:15:36,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-15 06:15:36,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8781#true} is VALID [2022-04-15 06:15:36,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {8781#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8786#(= main_~i~0 0)} is VALID [2022-04-15 06:15:36,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {8786#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8786#(= main_~i~0 0)} is VALID [2022-04-15 06:15:36,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {8786#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8787#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:36,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8787#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:36,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {8787#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8788#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:36,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8788#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:36,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {8788#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8789#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:36,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8789#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:36,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {8789#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8790#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:36,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8790#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:36,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {8790#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8791#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:36,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8791#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:36,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8792#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:36,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8792#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:36,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {8792#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8793#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:36,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {8794#(<= main_~n~0 7)} is VALID [2022-04-15 06:15:36,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(<= main_~n~0 7)} ~i~1 := 0; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 06:15:36,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 06:15:36,262 INFO L272 TraceCheckUtils]: 24: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,262 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8781#true} {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} #68#return; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 06:15:36,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} havoc #t~mem5; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 06:15:36,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:36,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:36,263 INFO L272 TraceCheckUtils]: 32: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,264 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8781#true} {8800#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:36,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:36,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:36,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:36,265 INFO L272 TraceCheckUtils]: 40: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,265 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8781#true} {8805#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:36,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:36,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:36,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:36,266 INFO L272 TraceCheckUtils]: 48: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,267 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,267 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,267 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8781#true} {8810#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:36,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:36,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:36,268 INFO L290 TraceCheckUtils]: 55: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:36,268 INFO L272 TraceCheckUtils]: 56: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,268 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,268 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,268 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,268 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8781#true} {8815#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:36,269 INFO L290 TraceCheckUtils]: 61: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:36,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:36,269 INFO L290 TraceCheckUtils]: 63: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:36,269 INFO L272 TraceCheckUtils]: 64: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,270 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,270 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,270 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8781#true} {8820#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:36,270 INFO L290 TraceCheckUtils]: 69: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:36,271 INFO L290 TraceCheckUtils]: 70: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:36,271 INFO L290 TraceCheckUtils]: 71: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:36,271 INFO L272 TraceCheckUtils]: 72: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,271 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,271 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,271 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8781#true} {8825#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:36,272 INFO L290 TraceCheckUtils]: 77: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:36,272 INFO L290 TraceCheckUtils]: 78: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8830#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:36,272 INFO L290 TraceCheckUtils]: 79: Hoare triple {8830#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8782#false} is VALID [2022-04-15 06:15:36,272 INFO L272 TraceCheckUtils]: 80: Hoare triple {8782#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8782#false} is VALID [2022-04-15 06:15:36,272 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-15 06:15:36,272 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-15 06:15:36,272 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-15 06:15:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 87 proven. 74 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 06:15:36,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:36,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965202947] [2022-04-15 06:15:36,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965202947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:36,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706416121] [2022-04-15 06:15:36,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:15:36,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:36,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:36,274 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:36,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 06:15:36,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:15:36,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:36,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:15:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:36,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:36,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-15 06:15:36,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#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(9, 2); {8781#true} is VALID [2022-04-15 06:15:36,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-15 06:15:36,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-15 06:15:36,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8781#true} is VALID [2022-04-15 06:15:36,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {8781#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8853#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:36,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {8853#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8853#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:36,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {8853#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8787#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:36,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8787#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:36,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {8787#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8788#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:36,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8788#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:36,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {8788#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8789#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:36,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8789#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:36,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {8789#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8790#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:36,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8790#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:36,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {8790#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8791#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:36,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8791#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:36,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8792#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:36,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8792#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:36,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {8792#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8793#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:36,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {8794#(<= main_~n~0 7)} is VALID [2022-04-15 06:15:36,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(<= main_~n~0 7)} ~i~1 := 0; {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,889 INFO L272 TraceCheckUtils]: 24: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,889 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8781#true} {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} #68#return; {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,891 INFO L272 TraceCheckUtils]: 32: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,891 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8781#true} {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} #68#return; {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:36,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:36,892 INFO L272 TraceCheckUtils]: 40: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,893 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8781#true} {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} #68#return; {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:36,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} havoc #t~mem5; {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:36,893 INFO L290 TraceCheckUtils]: 46: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:36,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:36,894 INFO L272 TraceCheckUtils]: 48: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,894 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,894 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,894 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8781#true} {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} #68#return; {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:36,895 INFO L290 TraceCheckUtils]: 53: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} havoc #t~mem5; {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:36,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:36,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:36,896 INFO L272 TraceCheckUtils]: 56: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,896 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8781#true} {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} #68#return; {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:36,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} havoc #t~mem5; {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:36,897 INFO L290 TraceCheckUtils]: 62: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,897 INFO L290 TraceCheckUtils]: 63: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,897 INFO L272 TraceCheckUtils]: 64: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,897 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,897 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,898 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8781#true} {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} #68#return; {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,898 INFO L290 TraceCheckUtils]: 69: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,898 INFO L290 TraceCheckUtils]: 70: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,899 INFO L290 TraceCheckUtils]: 71: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,899 INFO L272 TraceCheckUtils]: 72: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:36,899 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:36,899 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:36,899 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:36,899 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8781#true} {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} #68#return; {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,900 INFO L290 TraceCheckUtils]: 77: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,900 INFO L290 TraceCheckUtils]: 78: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9077#(and (<= 7 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 06:15:36,900 INFO L290 TraceCheckUtils]: 79: Hoare triple {9077#(and (<= 7 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8782#false} is VALID [2022-04-15 06:15:36,900 INFO L272 TraceCheckUtils]: 80: Hoare triple {8782#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8782#false} is VALID [2022-04-15 06:15:36,901 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-15 06:15:36,901 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-15 06:15:36,901 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-15 06:15:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 112 proven. 49 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 06:15:36,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:37,230 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-15 06:15:37,231 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-15 06:15:37,231 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-15 06:15:37,231 INFO L272 TraceCheckUtils]: 80: Hoare triple {8782#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8782#false} is VALID [2022-04-15 06:15:37,231 INFO L290 TraceCheckUtils]: 79: Hoare triple {8830#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8782#false} is VALID [2022-04-15 06:15:37,232 INFO L290 TraceCheckUtils]: 78: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8830#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:37,232 INFO L290 TraceCheckUtils]: 77: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:37,232 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8781#true} {8825#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:37,232 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:37,232 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:37,233 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:37,233 INFO L272 TraceCheckUtils]: 72: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:37,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:37,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:37,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:37,235 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8781#true} {8820#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:37,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:37,236 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:37,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:37,236 INFO L272 TraceCheckUtils]: 64: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:37,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:37,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:37,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:37,237 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8781#true} {8815#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:37,237 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:37,237 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:37,237 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:37,237 INFO L272 TraceCheckUtils]: 56: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:37,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:37,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:37,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:37,239 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8781#true} {8810#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:37,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:37,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:37,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:37,239 INFO L272 TraceCheckUtils]: 48: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:37,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:37,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:37,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:37,240 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8781#true} {8805#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:37,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:37,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:37,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:37,240 INFO L272 TraceCheckUtils]: 40: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:37,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:37,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:37,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:37,242 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8781#true} {8800#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:37,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:37,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:37,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:37,242 INFO L272 TraceCheckUtils]: 32: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:37,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:37,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:37,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:37,243 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8781#true} {9252#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:37,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:37,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 06:15:37,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 06:15:37,243 INFO L272 TraceCheckUtils]: 24: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 06:15:37,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:37,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(<= main_~n~0 7)} ~i~1 := 0; {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:37,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {8794#(<= main_~n~0 7)} is VALID [2022-04-15 06:15:37,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {8792#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8793#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:37,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8792#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:37,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8792#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:37,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8791#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:37,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {8790#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8791#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:37,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8790#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:37,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {8789#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8790#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:37,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8789#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:37,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {8788#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8789#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:37,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8788#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:37,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {8787#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8788#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:37,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8787#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:37,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {8853#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8787#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:37,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {8853#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8853#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:37,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {8781#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8853#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:37,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8781#true} is VALID [2022-04-15 06:15:37,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-15 06:15:37,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-15 06:15:37,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 06:15:37,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#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(9, 2); {8781#true} is VALID [2022-04-15 06:15:37,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-15 06:15:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 112 proven. 49 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 06:15:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706416121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:37,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:37,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 30 [2022-04-15 06:15:37,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42809977] [2022-04-15 06:15:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42809977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:37,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:37,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:15:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811603667] [2022-04-15 06:15:37,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 84 [2022-04-15 06:15:37,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:37,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:37,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:37,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:15:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:37,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:15:37,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:15:37,290 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:37,948 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-04-15 06:15:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:15:37,948 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 84 [2022-04-15 06:15:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-15 06:15:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-15 06:15:37,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-15 06:15:38,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:38,030 INFO L225 Difference]: With dead ends: 130 [2022-04-15 06:15:38,030 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 06:15:38,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=1756, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:15:38,031 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:38,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 49 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:15:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 06:15:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-15 06:15:38,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:38,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:38,067 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:38,068 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:38,069 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-15 06:15:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-15 06:15:38,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:38,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:38,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-15 06:15:38,069 INFO L87 Difference]: Start difference. First operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-15 06:15:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:38,070 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-15 06:15:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-15 06:15:38,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:38,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:38,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:38,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-04-15 06:15:38,072 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2022-04-15 06:15:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:38,072 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-04-15 06:15:38,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:38,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 90 transitions. [2022-04-15 06:15:38,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 06:15:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 06:15:38,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:38,174 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:38,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:38,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:38,387 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 27 times [2022-04-15 06:15:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:38,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [28598002] [2022-04-15 06:15:38,389 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:38,389 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:38,389 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 28 times [2022-04-15 06:15:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:38,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181416851] [2022-04-15 06:15:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {10051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {9997#true} is VALID [2022-04-15 06:15:38,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-15 06:15:38,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 06:15:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:38,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 06:15:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 06:15:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 06:15:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:38,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 06:15:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:38,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-15 06:15:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-15 06:15:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:38,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {10051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:38,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {10051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {9997#true} is VALID [2022-04-15 06:15:38,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-15 06:15:38,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-15 06:15:38,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9997#true} is VALID [2022-04-15 06:15:38,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {9997#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {10002#(= main_~i~0 0)} is VALID [2022-04-15 06:15:38,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {10002#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10002#(= main_~i~0 0)} is VALID [2022-04-15 06:15:38,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {10002#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:38,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:38,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:38,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:38,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:38,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:38,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:38,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:38,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:15:38,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:15:38,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:15:38,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:15:38,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10009#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:15:38,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {10009#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10010#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} is VALID [2022-04-15 06:15:38,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {10010#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-15 06:15:38,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-15 06:15:38,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:38,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:38,728 INFO L272 TraceCheckUtils]: 26: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 06:15:38,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,729 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9997#true} {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:38,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} havoc #t~mem5; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:38,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:38,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:38,730 INFO L272 TraceCheckUtils]: 34: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 06:15:38,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,730 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9997#true} {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:38,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:38,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:38,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:38,732 INFO L272 TraceCheckUtils]: 42: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 06:15:38,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,732 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9997#true} {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:38,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:38,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:38,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:38,734 INFO L272 TraceCheckUtils]: 50: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 06:15:38,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,734 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9997#true} {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:38,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:38,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:38,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:38,735 INFO L272 TraceCheckUtils]: 58: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 06:15:38,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,736 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9997#true} {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:38,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:38,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:38,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:38,737 INFO L272 TraceCheckUtils]: 66: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 06:15:38,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,738 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {9997#true} {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:38,738 INFO L290 TraceCheckUtils]: 71: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:38,739 INFO L290 TraceCheckUtils]: 72: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:38,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:38,739 INFO L272 TraceCheckUtils]: 74: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 06:15:38,739 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 06:15:38,739 INFO L290 TraceCheckUtils]: 76: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 06:15:38,739 INFO L290 TraceCheckUtils]: 77: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:38,740 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9997#true} {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:38,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:38,741 INFO L290 TraceCheckUtils]: 80: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10047#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:38,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {10047#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10048#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:38,741 INFO L272 TraceCheckUtils]: 82: Hoare triple {10048#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10049#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:15:38,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {10049#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10050#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:15:38,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {10050#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9998#false} is VALID [2022-04-15 06:15:38,742 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-15 06:15:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 14 proven. 162 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 06:15:38,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:38,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181416851] [2022-04-15 06:15:38,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181416851] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:38,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113272098] [2022-04-15 06:15:38,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:15:38,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:38,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:38,744 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:38,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 06:15:38,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:15:38,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:38,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:15:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:38,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:39,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:15:44,508 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:15:44,508 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 23 treesize of output 10 [2022-04-15 06:15:44,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {9997#true} is VALID [2022-04-15 06:15:44,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#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(9, 2); {9997#true} is VALID [2022-04-15 06:15:44,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 06:15:44,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-15 06:15:44,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-15 06:15:44,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9997#true} is VALID [2022-04-15 06:15:44,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {9997#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {10073#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:44,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {10073#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10073#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:44,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {10073#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10080#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:44,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {10080#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10080#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:44,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {10080#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10087#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:44,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {10087#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10087#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:44,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {10087#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10094#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:44,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {10094#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10094#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:44,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {10094#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10101#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:44,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {10101#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10101#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:44,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {10101#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10108#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:44,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {10108#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10108#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:44,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {10108#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10115#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:44,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {10115#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10115#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:44,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {10115#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10122#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:44,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {10122#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10126#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-15 06:15:44,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {10126#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10130#(exists ((v_main_~i~0_135 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0) (<= main_~i~0 (+ v_main_~i~0_135 1))))} is VALID [2022-04-15 06:15:44,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {10130#(exists ((v_main_~i~0_135 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0) (<= main_~i~0 (+ v_main_~i~0_135 1))))} assume !(~i~0 < ~n~0); {10134#(exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0)))} is VALID [2022-04-15 06:15:44,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {10134#(exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0)))} ~i~1 := 0; {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,611 INFO L272 TraceCheckUtils]: 26: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,613 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,615 INFO L272 TraceCheckUtils]: 34: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,617 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,620 INFO L272 TraceCheckUtils]: 42: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,621 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,624 INFO L272 TraceCheckUtils]: 50: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,625 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,626 INFO L290 TraceCheckUtils]: 55: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,626 INFO L290 TraceCheckUtils]: 56: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,627 INFO L290 TraceCheckUtils]: 57: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,628 INFO L272 TraceCheckUtils]: 58: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,629 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,631 INFO L290 TraceCheckUtils]: 64: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,632 INFO L272 TraceCheckUtils]: 66: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,633 INFO L290 TraceCheckUtils]: 68: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,633 INFO L290 TraceCheckUtils]: 69: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,634 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,634 INFO L290 TraceCheckUtils]: 71: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,635 INFO L290 TraceCheckUtils]: 73: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,636 INFO L272 TraceCheckUtils]: 74: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,637 INFO L290 TraceCheckUtils]: 75: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,637 INFO L290 TraceCheckUtils]: 76: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,638 INFO L290 TraceCheckUtils]: 77: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 06:15:44,638 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,639 INFO L290 TraceCheckUtils]: 79: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,639 INFO L290 TraceCheckUtils]: 80: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10314#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 06:15:44,640 INFO L290 TraceCheckUtils]: 81: Hoare triple {10314#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10048#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:44,640 INFO L272 TraceCheckUtils]: 82: Hoare triple {10048#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:15:44,640 INFO L290 TraceCheckUtils]: 83: Hoare triple {10321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:15:44,641 INFO L290 TraceCheckUtils]: 84: Hoare triple {10325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9998#false} is VALID [2022-04-15 06:15:44,641 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-15 06:15:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 91 proven. 85 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 06:15:44,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:45,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113272098] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:45,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:15:45,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2022-04-15 06:15:45,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:45,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [28598002] [2022-04-15 06:15:45,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [28598002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:45,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:45,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:15:45,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664918785] [2022-04-15 06:15:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:45,101 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 86 [2022-04-15 06:15:45,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:45,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:45,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:45,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:15:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:45,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:15:45,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:15:45,151 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:47,671 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-04-15 06:15:47,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:15:47,671 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 86 [2022-04-15 06:15:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-15 06:15:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-15 06:15:47,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 82 transitions. [2022-04-15 06:15:47,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:47,744 INFO L225 Difference]: With dead ends: 102 [2022-04-15 06:15:47,744 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 06:15:47,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=395, Invalid=4435, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:15:47,745 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:47,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 128 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:15:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 06:15:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-04-15 06:15:47,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:47,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:15:47,788 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:15:47,788 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:15:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:47,789 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 06:15:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 06:15:47,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:47,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:47,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-15 06:15:47,790 INFO L87 Difference]: Start difference. First operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-15 06:15:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:47,791 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 06:15:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 06:15:47,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:47,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:47,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:47,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:15:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-04-15 06:15:47,792 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2022-04-15 06:15:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:47,793 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-04-15 06:15:47,793 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:15:47,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 98 transitions. [2022-04-15 06:15:47,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 06:15:47,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 06:15:47,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:47,922 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:47,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 06:15:48,138 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 06:15:48,139 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:48,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 29 times [2022-04-15 06:15:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:48,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1799516764] [2022-04-15 06:15:48,141 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:48,141 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:48,141 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 30 times [2022-04-15 06:15:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:48,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404221777] [2022-04-15 06:15:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {11055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {10999#true} is VALID [2022-04-15 06:15:48,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-15 06:15:48,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 06:15:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} #68#return; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 06:15:48,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 06:15:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11019#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 06:15:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11024#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 06:15:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11029#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 06:15:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11034#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:48,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-15 06:15:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11039#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:48,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-15 06:15:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11044#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:48,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:15:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11049#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:48,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {11055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:48,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {11055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {10999#true} is VALID [2022-04-15 06:15:48,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-15 06:15:48,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-15 06:15:48,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {10999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10999#true} is VALID [2022-04-15 06:15:48,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {10999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11004#(= main_~i~0 0)} is VALID [2022-04-15 06:15:48,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {11004#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11004#(= main_~i~0 0)} is VALID [2022-04-15 06:15:48,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {11004#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11005#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:48,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11005#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:48,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11006#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:48,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {11006#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11006#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:48,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {11006#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11007#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:48,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11007#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:48,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11008#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:48,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {11008#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11008#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:48,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {11008#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11009#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:48,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11009#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:48,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11010#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:48,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {11010#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11010#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:48,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {11010#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11011#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:48,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {11011#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11011#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:48,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {11011#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11012#(<= main_~i~0 8)} is VALID [2022-04-15 06:15:48,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {11012#(<= main_~i~0 8)} assume !(~i~0 < ~n~0); {11013#(<= main_~n~0 8)} is VALID [2022-04-15 06:15:48,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(<= main_~n~0 8)} ~i~1 := 0; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 06:15:48,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 06:15:48,387 INFO L272 TraceCheckUtils]: 26: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:48,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,388 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10999#true} {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} #68#return; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 06:15:48,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} havoc #t~mem5; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 06:15:48,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:48,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:48,389 INFO L272 TraceCheckUtils]: 34: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:48,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,389 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#true} {11019#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:48,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:48,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:48,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:48,390 INFO L272 TraceCheckUtils]: 42: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:48,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,391 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10999#true} {11024#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:48,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:48,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:48,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:48,392 INFO L272 TraceCheckUtils]: 50: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:48,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,392 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10999#true} {11029#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:48,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:48,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:48,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:48,393 INFO L272 TraceCheckUtils]: 58: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:48,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,394 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10999#true} {11034#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:48,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:48,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:48,395 INFO L290 TraceCheckUtils]: 65: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:48,395 INFO L272 TraceCheckUtils]: 66: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:48,395 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,395 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,395 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,395 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10999#true} {11039#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:48,396 INFO L290 TraceCheckUtils]: 71: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:48,396 INFO L290 TraceCheckUtils]: 72: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:48,396 INFO L290 TraceCheckUtils]: 73: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:48,396 INFO L272 TraceCheckUtils]: 74: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:48,397 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,397 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,397 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,397 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10999#true} {11044#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:48,397 INFO L290 TraceCheckUtils]: 79: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:48,398 INFO L290 TraceCheckUtils]: 80: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:48,398 INFO L290 TraceCheckUtils]: 81: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:48,398 INFO L272 TraceCheckUtils]: 82: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:48,398 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:48,398 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:48,398 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:48,399 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10999#true} {11049#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:48,399 INFO L290 TraceCheckUtils]: 87: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:48,399 INFO L290 TraceCheckUtils]: 88: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11054#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:48,399 INFO L290 TraceCheckUtils]: 89: Hoare triple {11054#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11000#false} is VALID [2022-04-15 06:15:48,399 INFO L272 TraceCheckUtils]: 90: Hoare triple {11000#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11000#false} is VALID [2022-04-15 06:15:48,400 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-15 06:15:48,400 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-15 06:15:48,400 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-15 06:15:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 115 proven. 93 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 06:15:48,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:48,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404221777] [2022-04-15 06:15:48,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404221777] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:48,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775283136] [2022-04-15 06:15:48,400 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:15:48,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:48,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:48,401 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:48,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 06:15:48,483 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 06:15:48,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:48,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:15:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:48,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:49,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-15 06:15:49,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#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(9, 2); {10999#true} is VALID [2022-04-15 06:15:49,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-15 06:15:49,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-15 06:15:49,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {10999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10999#true} is VALID [2022-04-15 06:15:49,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {10999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11077#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:49,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {11077#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11077#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:49,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {11077#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11005#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:49,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11005#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:49,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11006#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:49,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {11006#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11006#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:49,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {11006#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11007#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:49,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11007#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:49,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11008#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:49,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {11008#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11008#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:49,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {11008#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11009#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:49,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11009#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:49,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11010#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:49,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {11010#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11010#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:49,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {11010#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11011#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:49,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {11011#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11011#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:49,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {11011#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11012#(<= main_~i~0 8)} is VALID [2022-04-15 06:15:49,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {11012#(<= main_~i~0 8)} assume !(~i~0 < ~n~0); {11013#(<= main_~n~0 8)} is VALID [2022-04-15 06:15:49,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(<= main_~n~0 8)} ~i~1 := 0; {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,121 INFO L272 TraceCheckUtils]: 26: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,124 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10999#true} {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} #68#return; {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,125 INFO L272 TraceCheckUtils]: 34: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,135 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#true} {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} #68#return; {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:49,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:49,136 INFO L272 TraceCheckUtils]: 42: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,137 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10999#true} {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} #68#return; {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:49,137 INFO L290 TraceCheckUtils]: 47: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} havoc #t~mem5; {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-15 06:15:49,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:49,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:49,138 INFO L272 TraceCheckUtils]: 50: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,139 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10999#true} {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} #68#return; {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:49,139 INFO L290 TraceCheckUtils]: 55: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} havoc #t~mem5; {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-15 06:15:49,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:49,140 INFO L290 TraceCheckUtils]: 57: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:49,140 INFO L272 TraceCheckUtils]: 58: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,141 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10999#true} {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} #68#return; {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:49,141 INFO L290 TraceCheckUtils]: 63: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} havoc #t~mem5; {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-15 06:15:49,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:49,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:49,142 INFO L272 TraceCheckUtils]: 66: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,143 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10999#true} {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} #68#return; {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:49,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} havoc #t~mem5; {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-15 06:15:49,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,144 INFO L290 TraceCheckUtils]: 73: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,144 INFO L272 TraceCheckUtils]: 74: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,144 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,144 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,144 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,144 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10999#true} {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} #68#return; {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,145 INFO L290 TraceCheckUtils]: 79: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,145 INFO L290 TraceCheckUtils]: 80: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,145 INFO L290 TraceCheckUtils]: 81: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,145 INFO L272 TraceCheckUtils]: 82: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,145 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,145 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,145 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,146 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10999#true} {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} #68#return; {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,146 INFO L290 TraceCheckUtils]: 87: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 06:15:49,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11332#(and (<= main_~n~0 8) (<= 8 main_~i~1))} is VALID [2022-04-15 06:15:49,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {11332#(and (<= main_~n~0 8) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11000#false} is VALID [2022-04-15 06:15:49,147 INFO L272 TraceCheckUtils]: 90: Hoare triple {11000#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11000#false} is VALID [2022-04-15 06:15:49,147 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-15 06:15:49,147 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-15 06:15:49,147 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-15 06:15:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 06:15:49,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:15:49,506 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-15 06:15:49,507 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-15 06:15:49,507 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-15 06:15:49,507 INFO L272 TraceCheckUtils]: 90: Hoare triple {11000#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11000#false} is VALID [2022-04-15 06:15:49,507 INFO L290 TraceCheckUtils]: 89: Hoare triple {11054#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11000#false} is VALID [2022-04-15 06:15:49,507 INFO L290 TraceCheckUtils]: 88: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11054#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:15:49,514 INFO L290 TraceCheckUtils]: 87: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:49,514 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10999#true} {11049#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:49,515 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,515 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,515 INFO L272 TraceCheckUtils]: 82: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:49,515 INFO L290 TraceCheckUtils]: 80: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:15:49,516 INFO L290 TraceCheckUtils]: 79: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:49,516 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10999#true} {11044#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:49,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,516 INFO L272 TraceCheckUtils]: 74: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,517 INFO L290 TraceCheckUtils]: 73: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:49,517 INFO L290 TraceCheckUtils]: 72: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:15:49,517 INFO L290 TraceCheckUtils]: 71: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:49,518 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10999#true} {11039#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:49,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,518 INFO L272 TraceCheckUtils]: 66: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:49,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:15:49,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:49,519 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10999#true} {11034#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:49,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,519 INFO L272 TraceCheckUtils]: 58: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:49,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:15:49,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:49,521 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10999#true} {11029#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:49,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,521 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,521 INFO L272 TraceCheckUtils]: 50: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:49,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:15:49,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:49,522 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10999#true} {11024#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:49,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,522 INFO L272 TraceCheckUtils]: 42: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:49,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:15:49,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:49,524 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#true} {11019#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:49,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,524 INFO L272 TraceCheckUtils]: 34: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:49,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:15:49,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:15:49,525 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10999#true} {11531#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:15:49,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 06:15:49,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 06:15:49,525 INFO L272 TraceCheckUtils]: 26: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 06:15:49,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:15:49,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(<= main_~n~0 8)} ~i~1 := 0; {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:15:49,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {11012#(<= main_~i~0 8)} assume !(~i~0 < ~n~0); {11013#(<= main_~n~0 8)} is VALID [2022-04-15 06:15:49,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {11011#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11012#(<= main_~i~0 8)} is VALID [2022-04-15 06:15:49,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {11011#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11011#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:49,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {11010#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11011#(<= main_~i~0 7)} is VALID [2022-04-15 06:15:49,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {11010#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11010#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:49,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11010#(<= main_~i~0 6)} is VALID [2022-04-15 06:15:49,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11009#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:49,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {11008#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11009#(<= main_~i~0 5)} is VALID [2022-04-15 06:15:49,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {11008#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11008#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:49,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11008#(<= main_~i~0 4)} is VALID [2022-04-15 06:15:49,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11007#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:49,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {11006#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11007#(<= main_~i~0 3)} is VALID [2022-04-15 06:15:49,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {11006#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11006#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:49,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11006#(<= main_~i~0 2)} is VALID [2022-04-15 06:15:49,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11005#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:49,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {11077#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11005#(<= main_~i~0 1)} is VALID [2022-04-15 06:15:49,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {11077#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11077#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:49,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {10999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11077#(<= main_~i~0 0)} is VALID [2022-04-15 06:15:49,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {10999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10999#true} is VALID [2022-04-15 06:15:49,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-15 06:15:49,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-15 06:15:49,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 06:15:49,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#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(9, 2); {10999#true} is VALID [2022-04-15 06:15:49,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-15 06:15:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 06:15:49,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775283136] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:15:49,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:15:49,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 33 [2022-04-15 06:15:49,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:15:49,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1799516764] [2022-04-15 06:15:49,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1799516764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:15:49,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:15:49,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:15:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473334354] [2022-04-15 06:15:49,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:15:49,533 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 94 [2022-04-15 06:15:49,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:15:49,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:49,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:49,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:15:49,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:49,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:15:49,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:15:49,589 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:50,375 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2022-04-15 06:15:50,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:15:50,375 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 94 [2022-04-15 06:15:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:15:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-15 06:15:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-15 06:15:50,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2022-04-15 06:15:50,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:50,673 INFO L225 Difference]: With dead ends: 144 [2022-04-15 06:15:50,673 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 06:15:50,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=490, Invalid=2162, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:15:50,675 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 48 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:15:50,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 61 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:15:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 06:15:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-04-15 06:15:50,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:15:50,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:15:50,733 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:15:50,733 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:15:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:50,734 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 06:15:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 06:15:50,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:50,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:50,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-15 06:15:50,735 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-15 06:15:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:15:50,736 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 06:15:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 06:15:50,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:15:50,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:15:50,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:15:50,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:15:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:15:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-15 06:15:50,738 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-04-15 06:15:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:15:50,738 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-15 06:15:50,738 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:15:50,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-15 06:15:50,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:15:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 06:15:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 06:15:50,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:15:50,868 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:15:50,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 06:15:51,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 06:15:51,079 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:15:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:15:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 31 times [2022-04-15 06:15:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:15:51,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1650006052] [2022-04-15 06:15:51,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:15:51,082 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:15:51,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:15:51,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 32 times [2022-04-15 06:15:51,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:15:51,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820084818] [2022-04-15 06:15:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:15:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:15:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:15:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {12414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {12354#true} is VALID [2022-04-15 06:15:51,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-15 06:15:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-15 06:15:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #68#return; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:51,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 06:15:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:15:51,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 06:15:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:51,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 06:15:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:51,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:15:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 06:15:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 06:15:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:51,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-15 06:15:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:51,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:15:51,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {12414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {12354#true} is VALID [2022-04-15 06:15:51,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-15 06:15:51,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-15 06:15:51,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {12354#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12354#true} is VALID [2022-04-15 06:15:51,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {12354#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12359#(= main_~i~0 0)} is VALID [2022-04-15 06:15:51,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {12359#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12359#(= main_~i~0 0)} is VALID [2022-04-15 06:15:51,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {12359#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:51,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:15:51,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:51,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:15:51,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:51,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:15:51,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:51,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:15:51,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:15:51,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:15:51,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:15:51,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:15:51,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:15:51,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:15:51,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:15:51,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12368#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:15:51,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {12368#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 06:15:51,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} assume !(~i~0 < ~n~0); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 06:15:51,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} ~i~1 := 0; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:51,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:51,542 INFO L272 TraceCheckUtils]: 28: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:15:51,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,542 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12354#true} {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #68#return; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:51,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} havoc #t~mem5; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:15:51,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:15:51,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:15:51,543 INFO L272 TraceCheckUtils]: 36: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:15:51,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,544 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12354#true} {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:15:51,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:15:51,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:51,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:51,545 INFO L272 TraceCheckUtils]: 44: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:15:51,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,545 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,546 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12354#true} {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:51,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:15:51,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:51,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:51,547 INFO L272 TraceCheckUtils]: 52: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:15:51,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,547 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,547 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,547 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12354#true} {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:51,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:15:51,548 INFO L290 TraceCheckUtils]: 58: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:51,548 INFO L290 TraceCheckUtils]: 59: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:51,548 INFO L272 TraceCheckUtils]: 60: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:15:51,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,549 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,549 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12354#true} {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:51,549 INFO L290 TraceCheckUtils]: 65: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:51,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:51,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:51,550 INFO L272 TraceCheckUtils]: 68: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:15:51,550 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,550 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,550 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,551 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12354#true} {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:51,551 INFO L290 TraceCheckUtils]: 73: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:15:51,551 INFO L290 TraceCheckUtils]: 74: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:51,552 INFO L290 TraceCheckUtils]: 75: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:51,552 INFO L272 TraceCheckUtils]: 76: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:15:51,552 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,552 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,552 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,552 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12354#true} {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:51,553 INFO L290 TraceCheckUtils]: 81: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:15:51,553 INFO L290 TraceCheckUtils]: 82: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:51,553 INFO L290 TraceCheckUtils]: 83: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:51,553 INFO L272 TraceCheckUtils]: 84: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:15:51,554 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:15:51,554 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:15:51,554 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:15:51,554 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12354#true} {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:51,554 INFO L290 TraceCheckUtils]: 89: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:15:51,555 INFO L290 TraceCheckUtils]: 90: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:15:51,555 INFO L290 TraceCheckUtils]: 91: Hoare triple {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12411#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:15:51,555 INFO L272 TraceCheckUtils]: 92: Hoare triple {12411#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:15:51,556 INFO L290 TraceCheckUtils]: 93: Hoare triple {12412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:15:51,556 INFO L290 TraceCheckUtils]: 94: Hoare triple {12413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12355#false} is VALID [2022-04-15 06:15:51,556 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-15 06:15:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 06:15:51,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:15:51,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820084818] [2022-04-15 06:15:51,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820084818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:15:51,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851640325] [2022-04-15 06:15:51,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:15:51,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:15:51,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:15:51,558 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:15:51,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 06:15:51,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:15:51,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:15:51,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 06:15:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:15:51,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:15:51,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:17:37,069 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 19 treesize of output 7 [2022-04-15 06:17:37,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-15 06:17:37,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#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(9, 2); {12354#true} is VALID [2022-04-15 06:17:37,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:37,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-15 06:17:37,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-15 06:17:37,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {12354#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12354#true} is VALID [2022-04-15 06:17:37,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {12354#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12359#(= main_~i~0 0)} is VALID [2022-04-15 06:17:37,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {12359#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12359#(= main_~i~0 0)} is VALID [2022-04-15 06:17:37,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {12359#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:17:37,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:17:37,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:17:37,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:17:37,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:17:37,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:17:37,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:17:37,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:17:37,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:17:37,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:17:37,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:17:37,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:17:37,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:17:37,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:17:37,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:17:37,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 06:17:37,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 06:17:37,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} assume !(~i~0 < ~n~0); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 06:17:37,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} ~i~1 := 0; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:17:37,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:17:37,133 INFO L272 TraceCheckUtils]: 28: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,134 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #68#return; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:17:37,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} havoc #t~mem5; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:17:37,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 06:17:37,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 06:17:37,136 INFO L272 TraceCheckUtils]: 36: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,137 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} #68#return; {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 06:17:37,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} havoc #t~mem5; {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 06:17:37,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,139 INFO L272 TraceCheckUtils]: 44: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,141 INFO L290 TraceCheckUtils]: 47: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,142 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,143 INFO L290 TraceCheckUtils]: 51: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,143 INFO L272 TraceCheckUtils]: 52: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,144 INFO L290 TraceCheckUtils]: 54: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,145 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,146 INFO L272 TraceCheckUtils]: 60: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,148 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,148 INFO L290 TraceCheckUtils]: 65: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,149 INFO L290 TraceCheckUtils]: 67: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,149 INFO L272 TraceCheckUtils]: 68: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,150 INFO L290 TraceCheckUtils]: 70: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,151 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,151 INFO L290 TraceCheckUtils]: 73: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,151 INFO L290 TraceCheckUtils]: 74: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,152 INFO L290 TraceCheckUtils]: 75: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,152 INFO L272 TraceCheckUtils]: 76: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,152 INFO L290 TraceCheckUtils]: 77: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,153 INFO L290 TraceCheckUtils]: 79: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,153 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,154 INFO L290 TraceCheckUtils]: 82: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,155 INFO L272 TraceCheckUtils]: 84: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,156 INFO L290 TraceCheckUtils]: 86: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,156 INFO L290 TraceCheckUtils]: 87: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 06:17:37,156 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,157 INFO L290 TraceCheckUtils]: 89: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,157 INFO L290 TraceCheckUtils]: 90: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12696#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 06:17:37,157 INFO L290 TraceCheckUtils]: 91: Hoare triple {12696#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12411#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:17:37,158 INFO L272 TraceCheckUtils]: 92: Hoare triple {12411#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:17:37,158 INFO L290 TraceCheckUtils]: 93: Hoare triple {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:17:37,158 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-15 06:17:37,158 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-15 06:17:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 06:17:37,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:17:39,444 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 16 treesize of output 14 [2022-04-15 06:17:39,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-15 06:17:39,593 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-15 06:17:39,594 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-15 06:17:39,594 INFO L290 TraceCheckUtils]: 93: Hoare triple {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:17:39,595 INFO L272 TraceCheckUtils]: 92: Hoare triple {12411#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:17:39,595 INFO L290 TraceCheckUtils]: 91: Hoare triple {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12411#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:17:39,596 INFO L290 TraceCheckUtils]: 90: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:39,596 INFO L290 TraceCheckUtils]: 89: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:17:39,597 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12354#true} {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:17:39,597 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:39,597 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:17:39,597 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:17:39,597 INFO L272 TraceCheckUtils]: 84: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:17:39,597 INFO L290 TraceCheckUtils]: 83: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:17:39,598 INFO L290 TraceCheckUtils]: 82: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:17:39,598 INFO L290 TraceCheckUtils]: 81: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:17:39,599 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12354#true} {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:17:39,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:39,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:17:39,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:17:39,599 INFO L272 TraceCheckUtils]: 76: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:17:39,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:17:39,600 INFO L290 TraceCheckUtils]: 74: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:17:39,600 INFO L290 TraceCheckUtils]: 73: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:17:39,601 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12354#true} {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:17:39,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:39,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:17:39,601 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:17:39,601 INFO L272 TraceCheckUtils]: 68: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:17:39,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:17:39,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:17:39,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:39,603 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12354#true} {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:39,603 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:39,603 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:17:39,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:17:39,603 INFO L272 TraceCheckUtils]: 60: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:17:39,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:39,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:39,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:17:39,605 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12354#true} {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:17:39,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:39,605 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:17:39,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:17:39,605 INFO L272 TraceCheckUtils]: 52: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:17:39,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:17:39,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:17:39,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:17:39,607 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12354#true} {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:17:39,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:39,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:17:39,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:17:39,607 INFO L272 TraceCheckUtils]: 44: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:17:39,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:17:39,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:17:39,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:17:39,609 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12354#true} {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:17:39,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:39,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:17:39,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:17:39,609 INFO L272 TraceCheckUtils]: 36: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:17:39,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:17:39,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:17:39,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:39,611 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12354#true} {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:39,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:39,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 06:17:39,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 06:17:39,611 INFO L272 TraceCheckUtils]: 28: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 06:17:39,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:39,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} ~i~1 := 0; {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:39,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} assume !(~i~0 < ~n~0); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 06:17:39,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 06:17:39,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 06:17:39,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:17:39,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:17:39,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:17:39,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:17:39,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:17:39,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:17:39,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:17:39,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:17:39,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:17:39,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:17:39,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:17:39,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:17:39,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:17:39,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:17:39,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {12359#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:17:39,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {12359#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12359#(= main_~i~0 0)} is VALID [2022-04-15 06:17:39,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {12354#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12359#(= main_~i~0 0)} is VALID [2022-04-15 06:17:39,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {12354#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12354#true} is VALID [2022-04-15 06:17:39,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-15 06:17:39,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-15 06:17:39,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 06:17:39,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#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(9, 2); {12354#true} is VALID [2022-04-15 06:17:39,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-15 06:17:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 06:17:39,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851640325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:17:39,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:17:39,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 38 [2022-04-15 06:17:39,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:17:39,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1650006052] [2022-04-15 06:17:39,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1650006052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:39,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:39,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:17:39,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463050662] [2022-04-15 06:17:39,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:17:39,623 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 96 [2022-04-15 06:17:39,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:17:39,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:17:39,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:39,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:17:39,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:39,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:17:39,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1291, Unknown=9, NotChecked=0, Total=1406 [2022-04-15 06:17:39,678 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:17:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:42,752 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-04-15 06:17:42,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:17:42,752 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 96 [2022-04-15 06:17:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:17:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:17:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-15 06:17:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:17:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-15 06:17:42,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 89 transitions. [2022-04-15 06:17:42,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:42,837 INFO L225 Difference]: With dead ends: 112 [2022-04-15 06:17:42,837 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 06:17:42,845 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 178 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 107.1s TimeCoverageRelationStatistics Valid=244, Invalid=3529, Unknown=9, NotChecked=0, Total=3782 [2022-04-15 06:17:42,845 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:17:42,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 131 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:17:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 06:17:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2022-04-15 06:17:42,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:42,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:17:42,890 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:17:42,891 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:17:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:42,892 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 06:17:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 06:17:42,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:42,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:42,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-15 06:17:42,893 INFO L87 Difference]: Start difference. First operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-15 06:17:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:42,895 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 06:17:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 06:17:42,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:42,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:42,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:42,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:17:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-15 06:17:42,896 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2022-04-15 06:17:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:42,897 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-15 06:17:42,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 06:17:42,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-15 06:17:43,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-15 06:17:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-15 06:17:43,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:43,039 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:43,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 06:17:43,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 06:17:43,240 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:43,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 33 times [2022-04-15 06:17:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:43,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1233512828] [2022-04-15 06:17:43,242 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:17:43,242 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:17:43,242 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:17:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 34 times [2022-04-15 06:17:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:17:43,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136586966] [2022-04-15 06:17:43,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:17:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:17:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {13708#true} is VALID [2022-04-15 06:17:43,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-15 06:17:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-15 06:17:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} #68#return; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 06:17:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 06:17:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13729#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:43,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 06:17:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13734#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 06:17:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13739#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:17:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13744#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:43,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 06:17:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13749#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:43,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 06:17:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13754#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-15 06:17:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13759#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-15 06:17:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13764#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:43,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:17:43,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {13708#true} is VALID [2022-04-15 06:17:43,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-15 06:17:43,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-15 06:17:43,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {13708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13708#true} is VALID [2022-04-15 06:17:43,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {13708#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13713#(= main_~i~0 0)} is VALID [2022-04-15 06:17:43,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {13713#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13713#(= main_~i~0 0)} is VALID [2022-04-15 06:17:43,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {13713#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13714#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:43,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13714#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:43,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13715#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:43,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {13715#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13715#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:43,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {13715#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13716#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:43,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {13716#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13716#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:43,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {13716#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13717#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:43,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {13717#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13717#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:43,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {13717#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13718#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:43,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {13718#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13718#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:43,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {13718#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13719#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:43,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {13719#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13719#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:43,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {13719#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13720#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:43,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {13720#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13720#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:43,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {13720#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13721#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:43,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {13721#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13721#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:43,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {13721#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13722#(<= main_~i~0 9)} is VALID [2022-04-15 06:17:43,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {13722#(<= main_~i~0 9)} assume !(~i~0 < ~n~0); {13723#(<= main_~n~0 9)} is VALID [2022-04-15 06:17:43,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {13723#(<= main_~n~0 9)} ~i~1 := 0; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 06:17:43,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 06:17:43,492 INFO L272 TraceCheckUtils]: 28: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:43,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,492 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13708#true} {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} #68#return; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 06:17:43,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} havoc #t~mem5; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 06:17:43,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:43,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:43,493 INFO L272 TraceCheckUtils]: 36: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:43,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,494 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13708#true} {13729#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:43,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:43,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:43,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:43,495 INFO L272 TraceCheckUtils]: 44: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:43,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,495 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13708#true} {13734#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:43,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:43,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:43,496 INFO L290 TraceCheckUtils]: 51: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:43,497 INFO L272 TraceCheckUtils]: 52: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:43,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,497 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13708#true} {13739#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:43,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:43,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:43,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:43,498 INFO L272 TraceCheckUtils]: 60: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:43,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,499 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13708#true} {13744#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:43,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:43,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:43,500 INFO L290 TraceCheckUtils]: 67: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:43,500 INFO L272 TraceCheckUtils]: 68: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:43,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,500 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13708#true} {13749#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:43,501 INFO L290 TraceCheckUtils]: 73: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:43,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:43,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:43,502 INFO L272 TraceCheckUtils]: 76: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:43,502 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,502 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,502 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13708#true} {13754#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:43,502 INFO L290 TraceCheckUtils]: 81: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:43,503 INFO L290 TraceCheckUtils]: 82: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:43,503 INFO L290 TraceCheckUtils]: 83: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:43,503 INFO L272 TraceCheckUtils]: 84: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:43,503 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,503 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,503 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,504 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13708#true} {13759#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:43,504 INFO L290 TraceCheckUtils]: 89: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:43,505 INFO L290 TraceCheckUtils]: 90: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:43,505 INFO L290 TraceCheckUtils]: 91: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:43,505 INFO L272 TraceCheckUtils]: 92: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:43,505 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:43,505 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:43,505 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:43,506 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13708#true} {13764#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:43,506 INFO L290 TraceCheckUtils]: 97: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:43,506 INFO L290 TraceCheckUtils]: 98: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13769#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:17:43,507 INFO L290 TraceCheckUtils]: 99: Hoare triple {13769#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13709#false} is VALID [2022-04-15 06:17:43,507 INFO L272 TraceCheckUtils]: 100: Hoare triple {13709#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13709#false} is VALID [2022-04-15 06:17:43,507 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-15 06:17:43,507 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-15 06:17:43,507 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-15 06:17:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 147 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 06:17:43,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:17:43,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136586966] [2022-04-15 06:17:43,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136586966] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:17:43,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674585475] [2022-04-15 06:17:43,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:17:43,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:43,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:17:43,509 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:17:43,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 06:17:43,657 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:17:43,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:17:43,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:17:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:43,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:17:44,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-15 06:17:44,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#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(9, 2); {13708#true} is VALID [2022-04-15 06:17:44,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-15 06:17:44,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-15 06:17:44,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {13708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13708#true} is VALID [2022-04-15 06:17:44,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {13708#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13792#(<= main_~i~0 0)} is VALID [2022-04-15 06:17:44,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {13792#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 0)} is VALID [2022-04-15 06:17:44,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {13792#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13714#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:44,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13714#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:44,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13715#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:44,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {13715#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13715#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:44,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {13715#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13716#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:44,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {13716#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13716#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:44,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {13716#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13717#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:44,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {13717#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13717#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:44,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {13717#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13718#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:44,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {13718#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13718#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:44,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {13718#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13719#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:44,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {13719#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13719#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:44,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {13719#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13720#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:44,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {13720#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13720#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:44,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {13720#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13721#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:44,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {13721#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13721#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:44,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {13721#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13722#(<= main_~i~0 9)} is VALID [2022-04-15 06:17:44,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {13722#(<= main_~i~0 9)} assume !(~i~0 < ~n~0); {13723#(<= main_~n~0 9)} is VALID [2022-04-15 06:17:44,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {13723#(<= main_~n~0 9)} ~i~1 := 0; {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-15 06:17:44,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-15 06:17:44,418 INFO L272 TraceCheckUtils]: 28: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,419 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13708#true} {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} #68#return; {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-15 06:17:44,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} havoc #t~mem5; {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-15 06:17:44,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 06:17:44,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 06:17:44,420 INFO L272 TraceCheckUtils]: 36: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,420 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13708#true} {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} #68#return; {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 06:17:44,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} havoc #t~mem5; {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 06:17:44,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-15 06:17:44,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-15 06:17:44,421 INFO L272 TraceCheckUtils]: 44: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,422 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13708#true} {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} #68#return; {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-15 06:17:44,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} havoc #t~mem5; {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-15 06:17:44,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-15 06:17:44,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-15 06:17:44,423 INFO L272 TraceCheckUtils]: 52: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,424 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13708#true} {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} #68#return; {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-15 06:17:44,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} havoc #t~mem5; {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-15 06:17:44,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-15 06:17:44,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-15 06:17:44,425 INFO L272 TraceCheckUtils]: 60: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,425 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,425 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,425 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13708#true} {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} #68#return; {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-15 06:17:44,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} havoc #t~mem5; {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-15 06:17:44,426 INFO L290 TraceCheckUtils]: 66: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-15 06:17:44,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-15 06:17:44,426 INFO L272 TraceCheckUtils]: 68: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,426 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,426 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,426 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,427 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13708#true} {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} #68#return; {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-15 06:17:44,427 INFO L290 TraceCheckUtils]: 73: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} havoc #t~mem5; {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-15 06:17:44,427 INFO L290 TraceCheckUtils]: 74: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 06:17:44,428 INFO L290 TraceCheckUtils]: 75: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 06:17:44,428 INFO L272 TraceCheckUtils]: 76: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,428 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,428 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,428 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,428 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13708#true} {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} #68#return; {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 06:17:44,429 INFO L290 TraceCheckUtils]: 81: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} havoc #t~mem5; {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 06:17:44,429 INFO L290 TraceCheckUtils]: 82: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-15 06:17:44,429 INFO L290 TraceCheckUtils]: 83: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-15 06:17:44,430 INFO L272 TraceCheckUtils]: 84: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,430 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,430 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,430 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,430 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13708#true} {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} #68#return; {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-15 06:17:44,430 INFO L290 TraceCheckUtils]: 89: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} havoc #t~mem5; {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-15 06:17:44,431 INFO L290 TraceCheckUtils]: 90: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-15 06:17:44,431 INFO L290 TraceCheckUtils]: 91: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-15 06:17:44,431 INFO L272 TraceCheckUtils]: 92: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,431 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,431 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,431 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,432 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13708#true} {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} #68#return; {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-15 06:17:44,432 INFO L290 TraceCheckUtils]: 97: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} havoc #t~mem5; {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-15 06:17:44,432 INFO L290 TraceCheckUtils]: 98: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14078#(and (<= main_~n~0 9) (<= 9 main_~i~1))} is VALID [2022-04-15 06:17:44,433 INFO L290 TraceCheckUtils]: 99: Hoare triple {14078#(and (<= main_~n~0 9) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13709#false} is VALID [2022-04-15 06:17:44,433 INFO L272 TraceCheckUtils]: 100: Hoare triple {13709#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13709#false} is VALID [2022-04-15 06:17:44,433 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-15 06:17:44,433 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-15 06:17:44,433 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-15 06:17:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 180 proven. 81 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 06:17:44,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:17:44,855 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-15 06:17:44,855 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-15 06:17:44,855 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-15 06:17:44,855 INFO L272 TraceCheckUtils]: 100: Hoare triple {13709#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13709#false} is VALID [2022-04-15 06:17:44,855 INFO L290 TraceCheckUtils]: 99: Hoare triple {13769#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13709#false} is VALID [2022-04-15 06:17:44,856 INFO L290 TraceCheckUtils]: 98: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13769#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:17:44,856 INFO L290 TraceCheckUtils]: 97: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:44,856 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13708#true} {13764#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:44,857 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,857 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,857 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,857 INFO L272 TraceCheckUtils]: 92: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,857 INFO L290 TraceCheckUtils]: 91: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:44,857 INFO L290 TraceCheckUtils]: 90: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:44,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:44,858 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13708#true} {13759#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:44,858 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,858 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,858 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,858 INFO L272 TraceCheckUtils]: 84: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,859 INFO L290 TraceCheckUtils]: 83: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:44,859 INFO L290 TraceCheckUtils]: 82: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:44,859 INFO L290 TraceCheckUtils]: 81: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:44,860 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13708#true} {13754#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:44,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,860 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,860 INFO L272 TraceCheckUtils]: 76: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,860 INFO L290 TraceCheckUtils]: 75: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:44,861 INFO L290 TraceCheckUtils]: 74: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:44,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:44,861 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13708#true} {13749#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:44,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,861 INFO L272 TraceCheckUtils]: 68: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:44,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:44,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:44,863 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13708#true} {13744#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:44,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,863 INFO L272 TraceCheckUtils]: 60: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:44,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:44,864 INFO L290 TraceCheckUtils]: 57: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:44,864 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13708#true} {13739#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:44,864 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,864 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,864 INFO L272 TraceCheckUtils]: 52: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:44,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:44,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:44,866 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13708#true} {13734#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:44,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,866 INFO L272 TraceCheckUtils]: 44: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:44,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:44,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:44,869 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13708#true} {13729#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:44,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,869 INFO L272 TraceCheckUtils]: 36: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:44,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:44,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:17:44,870 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13708#true} {14301#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:17:44,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 06:17:44,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 06:17:44,871 INFO L272 TraceCheckUtils]: 28: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 06:17:44,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:17:44,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {13723#(<= main_~n~0 9)} ~i~1 := 0; {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:17:44,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {13722#(<= main_~i~0 9)} assume !(~i~0 < ~n~0); {13723#(<= main_~n~0 9)} is VALID [2022-04-15 06:17:44,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {13721#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13722#(<= main_~i~0 9)} is VALID [2022-04-15 06:17:44,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {13721#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13721#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:44,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {13720#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13721#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:44,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {13720#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13720#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:44,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {13719#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13720#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:44,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {13719#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13719#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:44,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {13718#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13719#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:44,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {13718#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13718#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:44,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {13717#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13718#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:44,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {13717#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13717#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:44,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {13716#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13717#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:44,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {13716#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13716#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:44,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {13715#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13716#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:44,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {13715#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13715#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:44,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13715#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:44,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13714#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:44,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {13792#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13714#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:44,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {13792#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 0)} is VALID [2022-04-15 06:17:44,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {13708#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13792#(<= main_~i~0 0)} is VALID [2022-04-15 06:17:44,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {13708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13708#true} is VALID [2022-04-15 06:17:44,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-15 06:17:44,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-15 06:17:44,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 06:17:44,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#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(9, 2); {13708#true} is VALID [2022-04-15 06:17:44,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-15 06:17:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 180 proven. 81 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 06:17:44,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674585475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:17:44,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:17:44,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 36 [2022-04-15 06:17:44,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:17:44,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1233512828] [2022-04-15 06:17:44,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1233512828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:44,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:44,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:17:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602344888] [2022-04-15 06:17:44,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:17:44,879 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 104 [2022-04-15 06:17:44,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:17:44,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:44,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:44,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:17:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:44,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:17:44,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:17:44,926 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:46,063 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-04-15 06:17:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:17:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 104 [2022-04-15 06:17:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:17:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-15 06:17:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-15 06:17:46,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 99 transitions. [2022-04-15 06:17:46,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:46,140 INFO L225 Difference]: With dead ends: 158 [2022-04-15 06:17:46,140 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 06:17:46,141 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=582, Invalid=2610, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:17:46,142 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:17:46,142 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 78 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:17:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 06:17:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-15 06:17:46,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:46,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:17:46,201 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:17:46,201 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:17:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:46,202 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 06:17:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 06:17:46,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:46,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:46,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-15 06:17:46,203 INFO L87 Difference]: Start difference. First operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-15 06:17:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:46,204 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 06:17:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 06:17:46,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:46,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:46,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:46,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:17:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-04-15 06:17:46,205 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-04-15 06:17:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:46,206 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-04-15 06:17:46,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:46,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 110 transitions. [2022-04-15 06:17:46,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 06:17:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 06:17:46,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:46,356 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:46,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 06:17:46,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:46,557 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 35 times [2022-04-15 06:17:46,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:46,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [249269786] [2022-04-15 06:17:46,560 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:17:46,560 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:17:46,560 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:17:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 36 times [2022-04-15 06:17:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:17:46,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159114654] [2022-04-15 06:17:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:17:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:17:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {15268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {15202#true} is VALID [2022-04-15 06:17:46,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-15 06:17:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 06:17:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} #68#return; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:17:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:17:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 06:17:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:17:46,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 06:17:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:17:46,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 06:17:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:17:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-15 06:17:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-15 06:17:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:17:46,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-15 06:17:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:17:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-15 06:17:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:46,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:17:46,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {15202#true} call ULTIMATE.init(); {15268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:17:46,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {15268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {15202#true} is VALID [2022-04-15 06:17:46,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-15 06:17:46,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-15 06:17:46,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {15202#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15202#true} is VALID [2022-04-15 06:17:46,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {15202#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {15207#(= main_~i~0 0)} is VALID [2022-04-15 06:17:46,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {15207#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15207#(= main_~i~0 0)} is VALID [2022-04-15 06:17:46,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {15207#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:17:46,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:17:46,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:17:46,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:17:46,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:17:46,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:17:46,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:17:46,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:17:46,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:17:46,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:17:46,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:17:46,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:17:46,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:17:46,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:17:46,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:17:46,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:17:46,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15216#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:17:46,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {15216#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15217#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:17:46,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {15217#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} is VALID [2022-04-15 06:17:46,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} assume !(~i~0 < ~n~0); {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} is VALID [2022-04-15 06:17:46,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} ~i~1 := 0; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:17:46,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:17:46,992 INFO L272 TraceCheckUtils]: 30: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 06:17:46,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,993 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15202#true} {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} #68#return; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:17:46,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} havoc #t~mem5; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:17:46,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:46,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:46,994 INFO L272 TraceCheckUtils]: 38: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 06:17:46,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,995 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15202#true} {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:46,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:46,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:17:46,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:17:46,996 INFO L272 TraceCheckUtils]: 46: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 06:17:46,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,996 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15202#true} {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:17:46,997 INFO L290 TraceCheckUtils]: 51: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:17:46,997 INFO L290 TraceCheckUtils]: 52: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:17:46,997 INFO L290 TraceCheckUtils]: 53: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:17:46,997 INFO L272 TraceCheckUtils]: 54: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 06:17:46,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,998 INFO L290 TraceCheckUtils]: 56: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,998 INFO L290 TraceCheckUtils]: 57: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:46,998 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15202#true} {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:17:46,998 INFO L290 TraceCheckUtils]: 59: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:17:46,999 INFO L290 TraceCheckUtils]: 60: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:17:46,999 INFO L290 TraceCheckUtils]: 61: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:17:46,999 INFO L272 TraceCheckUtils]: 62: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 06:17:46,999 INFO L290 TraceCheckUtils]: 63: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:46,999 INFO L290 TraceCheckUtils]: 64: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:46,999 INFO L290 TraceCheckUtils]: 65: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:47,000 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15202#true} {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:17:47,000 INFO L290 TraceCheckUtils]: 67: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:17:47,000 INFO L290 TraceCheckUtils]: 68: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:47,001 INFO L290 TraceCheckUtils]: 69: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:47,001 INFO L272 TraceCheckUtils]: 70: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 06:17:47,001 INFO L290 TraceCheckUtils]: 71: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:47,001 INFO L290 TraceCheckUtils]: 72: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:47,001 INFO L290 TraceCheckUtils]: 73: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:47,001 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15202#true} {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:47,002 INFO L290 TraceCheckUtils]: 75: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:47,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:17:47,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:17:47,002 INFO L272 TraceCheckUtils]: 78: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 06:17:47,002 INFO L290 TraceCheckUtils]: 79: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:47,002 INFO L290 TraceCheckUtils]: 80: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:47,003 INFO L290 TraceCheckUtils]: 81: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:47,003 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15202#true} {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:17:47,003 INFO L290 TraceCheckUtils]: 83: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:17:47,004 INFO L290 TraceCheckUtils]: 84: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:17:47,004 INFO L290 TraceCheckUtils]: 85: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:17:47,004 INFO L272 TraceCheckUtils]: 86: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 06:17:47,004 INFO L290 TraceCheckUtils]: 87: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:47,004 INFO L290 TraceCheckUtils]: 88: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:47,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:47,005 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15202#true} {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:17:47,005 INFO L290 TraceCheckUtils]: 91: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:17:47,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:17:47,006 INFO L290 TraceCheckUtils]: 93: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:17:47,006 INFO L272 TraceCheckUtils]: 94: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 06:17:47,006 INFO L290 TraceCheckUtils]: 95: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 06:17:47,006 INFO L290 TraceCheckUtils]: 96: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 06:17:47,006 INFO L290 TraceCheckUtils]: 97: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:47,006 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15202#true} {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:17:47,006 INFO L290 TraceCheckUtils]: 99: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:17:47,007 INFO L290 TraceCheckUtils]: 100: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15264#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:17:47,007 INFO L290 TraceCheckUtils]: 101: Hoare triple {15264#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15265#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:17:47,008 INFO L272 TraceCheckUtils]: 102: Hoare triple {15265#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:17:47,008 INFO L290 TraceCheckUtils]: 103: Hoare triple {15266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:17:47,008 INFO L290 TraceCheckUtils]: 104: Hoare triple {15267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15203#false} is VALID [2022-04-15 06:17:47,008 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-15 06:17:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 18 proven. 262 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 06:17:47,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:17:47,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159114654] [2022-04-15 06:17:47,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159114654] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:17:47,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629935639] [2022-04-15 06:17:47,009 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:17:47,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:47,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:17:47,010 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:17:47,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 06:17:47,183 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-15 06:17:47,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:17:47,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:17:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:47,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:17:47,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:17:54,959 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:17:54,959 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 23 treesize of output 10 [2022-04-15 06:17:55,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {15202#true} call ULTIMATE.init(); {15202#true} is VALID [2022-04-15 06:17:55,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#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(9, 2); {15202#true} is VALID [2022-04-15 06:17:55,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 06:17:55,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-15 06:17:55,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-15 06:17:55,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {15202#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15202#true} is VALID [2022-04-15 06:17:55,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {15202#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {15290#(<= main_~i~0 0)} is VALID [2022-04-15 06:17:55,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {15290#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15290#(<= main_~i~0 0)} is VALID [2022-04-15 06:17:55,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {15290#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15297#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:55,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {15297#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15297#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:55,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {15297#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15304#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:55,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {15304#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15304#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:55,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {15304#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15311#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:55,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {15311#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15311#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:55,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {15311#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15318#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:55,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {15318#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15318#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:55,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {15318#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15325#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:55,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {15325#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15325#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:55,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {15325#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15332#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:55,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {15332#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15332#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:55,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {15332#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15339#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:55,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {15339#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15339#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:55,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {15339#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15346#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:55,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {15346#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15346#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:55,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {15346#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15353#(<= main_~i~0 9)} is VALID [2022-04-15 06:17:55,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {15353#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15357#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 9))} is VALID [2022-04-15 06:17:55,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {15357#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15361#(exists ((v_main_~i~0_207 Int)) (and (<= main_~i~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {15361#(exists ((v_main_~i~0_207 Int)) (and (<= main_~i~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} assume !(~i~0 < ~n~0); {15365#(exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {15365#(exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} ~i~1 := 0; {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,076 INFO L272 TraceCheckUtils]: 30: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,083 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,087 INFO L272 TraceCheckUtils]: 38: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,089 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,094 INFO L272 TraceCheckUtils]: 46: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,100 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,101 INFO L290 TraceCheckUtils]: 52: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,104 INFO L272 TraceCheckUtils]: 54: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,109 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,113 INFO L272 TraceCheckUtils]: 62: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,118 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,120 INFO L290 TraceCheckUtils]: 69: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,123 INFO L272 TraceCheckUtils]: 70: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,127 INFO L290 TraceCheckUtils]: 71: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,127 INFO L290 TraceCheckUtils]: 72: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,128 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,129 INFO L290 TraceCheckUtils]: 75: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,129 INFO L290 TraceCheckUtils]: 76: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,130 INFO L290 TraceCheckUtils]: 77: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,133 INFO L272 TraceCheckUtils]: 78: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,133 INFO L290 TraceCheckUtils]: 79: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,135 INFO L290 TraceCheckUtils]: 80: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,137 INFO L290 TraceCheckUtils]: 81: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,138 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,138 INFO L290 TraceCheckUtils]: 83: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,139 INFO L290 TraceCheckUtils]: 84: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,140 INFO L290 TraceCheckUtils]: 85: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,143 INFO L272 TraceCheckUtils]: 86: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,143 INFO L290 TraceCheckUtils]: 87: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,161 INFO L290 TraceCheckUtils]: 88: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,165 INFO L290 TraceCheckUtils]: 89: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,166 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,167 INFO L290 TraceCheckUtils]: 91: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,168 INFO L290 TraceCheckUtils]: 92: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,171 INFO L272 TraceCheckUtils]: 94: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,177 INFO L290 TraceCheckUtils]: 95: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,180 INFO L290 TraceCheckUtils]: 96: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,185 INFO L290 TraceCheckUtils]: 97: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 06:17:55,186 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,186 INFO L290 TraceCheckUtils]: 99: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,187 INFO L290 TraceCheckUtils]: 100: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15595#(and (<= 9 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 06:17:55,188 INFO L290 TraceCheckUtils]: 101: Hoare triple {15595#(and (<= 9 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15265#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:17:55,188 INFO L272 TraceCheckUtils]: 102: Hoare triple {15265#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:17:55,188 INFO L290 TraceCheckUtils]: 103: Hoare triple {15602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:17:55,189 INFO L290 TraceCheckUtils]: 104: Hoare triple {15606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15203#false} is VALID [2022-04-15 06:17:55,189 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-15 06:17:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 153 proven. 127 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 06:17:55,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:17:55,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629935639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:17:55,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:17:55,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2022-04-15 06:17:55,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:17:55,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [249269786] [2022-04-15 06:17:55,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [249269786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:17:55,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:17:55,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:17:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128681525] [2022-04-15 06:17:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:17:55,474 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 106 [2022-04-15 06:17:55,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:17:55,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:55,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:55,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:17:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:55,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:17:55,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2777, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:17:55,551 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:58,994 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2022-04-15 06:17:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:17:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 106 [2022-04-15 06:17:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:17:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-15 06:17:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-15 06:17:58,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 96 transitions. [2022-04-15 06:17:59,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:59,072 INFO L225 Difference]: With dead ends: 122 [2022-04-15 06:17:59,073 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 06:17:59,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 88 SyntacticMatches, 18 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=511, Invalid=6131, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:17:59,074 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 75 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:17:59,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 142 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:17:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 06:17:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-04-15 06:17:59,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:17:59,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:17:59,128 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:17:59,128 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:17:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:59,130 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-15 06:17:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-15 06:17:59,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:59,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:59,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-15 06:17:59,130 INFO L87 Difference]: Start difference. First operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-15 06:17:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:17:59,131 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-15 06:17:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-15 06:17:59,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:17:59,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:17:59,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:17:59,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:17:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:17:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2022-04-15 06:17:59,133 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2022-04-15 06:17:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:17:59,133 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2022-04-15 06:17:59,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:17:59,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 118 transitions. [2022-04-15 06:17:59,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:17:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-15 06:17:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 06:17:59,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:17:59,305 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:17:59,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 06:17:59,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:59,506 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:17:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:17:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 37 times [2022-04-15 06:17:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:17:59,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1168253920] [2022-04-15 06:17:59,509 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:17:59,509 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:17:59,509 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:17:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 38 times [2022-04-15 06:17:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:17:59,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205138601] [2022-04-15 06:17:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:17:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:17:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:17:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {16476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {16408#true} is VALID [2022-04-15 06:17:59,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-15 06:17:59,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 06:17:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} #68#return; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 06:17:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:17:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16430#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:17:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 06:17:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16435#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 06:17:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16440#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 06:17:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16445#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-15 06:17:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16450#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:59,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-15 06:17:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16455#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-15 06:17:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16460#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-15 06:17:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16465#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:59,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-15 06:17:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16470#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:59,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:17:59,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {16476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {16408#true} is VALID [2022-04-15 06:17:59,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-15 06:17:59,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-15 06:17:59,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {16408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16408#true} is VALID [2022-04-15 06:17:59,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {16408#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16413#(= main_~i~0 0)} is VALID [2022-04-15 06:17:59,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {16413#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16413#(= main_~i~0 0)} is VALID [2022-04-15 06:17:59,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {16413#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16414#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:59,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {16414#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16414#(<= main_~i~0 1)} is VALID [2022-04-15 06:17:59,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {16414#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16415#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:59,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {16415#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16415#(<= main_~i~0 2)} is VALID [2022-04-15 06:17:59,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {16415#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16416#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:59,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {16416#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16416#(<= main_~i~0 3)} is VALID [2022-04-15 06:17:59,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {16416#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16417#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:59,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {16417#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16417#(<= main_~i~0 4)} is VALID [2022-04-15 06:17:59,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {16417#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16418#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:59,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {16418#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16418#(<= main_~i~0 5)} is VALID [2022-04-15 06:17:59,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {16418#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16419#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:59,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {16419#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16419#(<= main_~i~0 6)} is VALID [2022-04-15 06:17:59,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {16419#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16420#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:59,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {16420#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16420#(<= main_~i~0 7)} is VALID [2022-04-15 06:17:59,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {16420#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16421#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:59,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {16421#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16421#(<= main_~i~0 8)} is VALID [2022-04-15 06:17:59,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {16421#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16422#(<= main_~i~0 9)} is VALID [2022-04-15 06:17:59,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {16422#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16422#(<= main_~i~0 9)} is VALID [2022-04-15 06:17:59,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {16422#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16423#(<= main_~i~0 10)} is VALID [2022-04-15 06:17:59,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#(<= main_~i~0 10)} assume !(~i~0 < ~n~0); {16424#(<= main_~n~0 10)} is VALID [2022-04-15 06:17:59,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {16424#(<= main_~n~0 10)} ~i~1 := 0; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 06:17:59,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 06:17:59,807 INFO L272 TraceCheckUtils]: 30: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,807 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16408#true} {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} #68#return; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 06:17:59,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} havoc #t~mem5; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 06:17:59,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:17:59,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:17:59,808 INFO L272 TraceCheckUtils]: 38: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,809 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16408#true} {16430#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:17:59,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:17:59,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:59,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:59,810 INFO L272 TraceCheckUtils]: 46: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,810 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16408#true} {16435#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:59,810 INFO L290 TraceCheckUtils]: 51: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:17:59,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:59,811 INFO L290 TraceCheckUtils]: 53: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:59,811 INFO L272 TraceCheckUtils]: 54: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,811 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16408#true} {16440#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:59,812 INFO L290 TraceCheckUtils]: 59: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:17:59,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:59,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:59,812 INFO L272 TraceCheckUtils]: 62: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,813 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,813 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16408#true} {16445#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:59,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:17:59,814 INFO L290 TraceCheckUtils]: 68: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:59,814 INFO L290 TraceCheckUtils]: 69: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:59,814 INFO L272 TraceCheckUtils]: 70: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,814 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,814 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,814 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,815 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16408#true} {16450#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:59,815 INFO L290 TraceCheckUtils]: 75: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:17:59,815 INFO L290 TraceCheckUtils]: 76: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:59,816 INFO L290 TraceCheckUtils]: 77: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:59,816 INFO L272 TraceCheckUtils]: 78: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,816 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,816 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16408#true} {16455#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:59,817 INFO L290 TraceCheckUtils]: 83: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:17:59,817 INFO L290 TraceCheckUtils]: 84: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:59,817 INFO L290 TraceCheckUtils]: 85: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:59,817 INFO L272 TraceCheckUtils]: 86: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,817 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,817 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,818 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,818 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16408#true} {16460#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:59,818 INFO L290 TraceCheckUtils]: 91: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:17:59,819 INFO L290 TraceCheckUtils]: 92: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:59,819 INFO L290 TraceCheckUtils]: 93: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:59,819 INFO L272 TraceCheckUtils]: 94: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,819 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,819 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,819 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,820 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16408#true} {16465#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:59,820 INFO L290 TraceCheckUtils]: 99: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:17:59,820 INFO L290 TraceCheckUtils]: 100: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:59,821 INFO L290 TraceCheckUtils]: 101: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:59,821 INFO L272 TraceCheckUtils]: 102: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:17:59,821 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:17:59,821 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:17:59,821 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:17:59,821 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16408#true} {16470#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:59,822 INFO L290 TraceCheckUtils]: 107: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:17:59,822 INFO L290 TraceCheckUtils]: 108: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16475#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:17:59,822 INFO L290 TraceCheckUtils]: 109: Hoare triple {16475#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16409#false} is VALID [2022-04-15 06:17:59,823 INFO L272 TraceCheckUtils]: 110: Hoare triple {16409#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16409#false} is VALID [2022-04-15 06:17:59,823 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-15 06:17:59,823 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-15 06:17:59,823 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-15 06:17:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 183 proven. 137 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 06:17:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:17:59,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205138601] [2022-04-15 06:17:59,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205138601] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:17:59,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150221564] [2022-04-15 06:17:59,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:17:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:17:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:17:59,825 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:17:59,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 06:17:59,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:17:59,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:17:59,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:17:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:17:59,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:00,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-15 06:18:00,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#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(9, 2); {16408#true} is VALID [2022-04-15 06:18:00,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-15 06:18:00,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-15 06:18:00,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {16408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16408#true} is VALID [2022-04-15 06:18:00,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {16408#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16498#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:00,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {16498#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16498#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:00,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {16498#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16414#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:00,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {16414#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16414#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:00,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {16414#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16415#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:00,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {16415#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16415#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:00,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {16415#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16416#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:00,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {16416#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16416#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:00,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {16416#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16417#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:00,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {16417#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16417#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:00,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {16417#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16418#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:00,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {16418#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16418#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:00,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {16418#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16419#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:00,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {16419#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16419#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:00,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {16419#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16420#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:00,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {16420#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16420#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:00,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {16420#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16421#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:00,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {16421#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16421#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:00,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {16421#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16422#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:00,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {16422#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16422#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:00,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {16422#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16423#(<= main_~i~0 10)} is VALID [2022-04-15 06:18:00,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#(<= main_~i~0 10)} assume !(~i~0 < ~n~0); {16424#(<= main_~n~0 10)} is VALID [2022-04-15 06:18:00,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {16424#(<= main_~n~0 10)} ~i~1 := 0; {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-15 06:18:00,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-15 06:18:00,700 INFO L272 TraceCheckUtils]: 30: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,701 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16408#true} {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} #68#return; {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-15 06:18:00,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} havoc #t~mem5; {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-15 06:18:00,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 06:18:00,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 06:18:00,702 INFO L272 TraceCheckUtils]: 38: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,702 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16408#true} {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} #68#return; {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 06:18:00,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} havoc #t~mem5; {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 06:18:00,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-15 06:18:00,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-15 06:18:00,703 INFO L272 TraceCheckUtils]: 46: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,704 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16408#true} {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} #68#return; {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-15 06:18:00,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} havoc #t~mem5; {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-15 06:18:00,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-15 06:18:00,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-15 06:18:00,705 INFO L272 TraceCheckUtils]: 54: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,705 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,705 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,706 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16408#true} {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} #68#return; {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-15 06:18:00,706 INFO L290 TraceCheckUtils]: 59: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} havoc #t~mem5; {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-15 06:18:00,707 INFO L290 TraceCheckUtils]: 60: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-15 06:18:00,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-15 06:18:00,708 INFO L272 TraceCheckUtils]: 62: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,708 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,708 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,708 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16408#true} {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} #68#return; {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-15 06:18:00,709 INFO L290 TraceCheckUtils]: 67: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} havoc #t~mem5; {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-15 06:18:00,709 INFO L290 TraceCheckUtils]: 68: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-15 06:18:00,709 INFO L290 TraceCheckUtils]: 69: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-15 06:18:00,709 INFO L272 TraceCheckUtils]: 70: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,710 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,710 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16408#true} {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} #68#return; {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-15 06:18:00,710 INFO L290 TraceCheckUtils]: 75: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} havoc #t~mem5; {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-15 06:18:00,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 06:18:00,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 06:18:00,711 INFO L272 TraceCheckUtils]: 78: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,711 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,711 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,711 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,712 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16408#true} {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} #68#return; {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 06:18:00,712 INFO L290 TraceCheckUtils]: 83: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} havoc #t~mem5; {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 06:18:00,712 INFO L290 TraceCheckUtils]: 84: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-15 06:18:00,713 INFO L290 TraceCheckUtils]: 85: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-15 06:18:00,713 INFO L272 TraceCheckUtils]: 86: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,713 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,713 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,713 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,713 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16408#true} {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} #68#return; {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-15 06:18:00,714 INFO L290 TraceCheckUtils]: 91: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} havoc #t~mem5; {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-15 06:18:00,714 INFO L290 TraceCheckUtils]: 92: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-15 06:18:00,714 INFO L290 TraceCheckUtils]: 93: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-15 06:18:00,714 INFO L272 TraceCheckUtils]: 94: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,714 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,714 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,715 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,715 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16408#true} {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} #68#return; {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-15 06:18:00,715 INFO L290 TraceCheckUtils]: 99: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} havoc #t~mem5; {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-15 06:18:00,716 INFO L290 TraceCheckUtils]: 100: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-15 06:18:00,716 INFO L290 TraceCheckUtils]: 101: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-15 06:18:00,716 INFO L272 TraceCheckUtils]: 102: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:00,716 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:00,716 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:00,716 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:00,716 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16408#true} {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} #68#return; {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-15 06:18:00,717 INFO L290 TraceCheckUtils]: 107: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} havoc #t~mem5; {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-15 06:18:00,717 INFO L290 TraceCheckUtils]: 108: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16815#(and (<= 10 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 06:18:00,718 INFO L290 TraceCheckUtils]: 109: Hoare triple {16815#(and (<= 10 main_~i~1) (<= main_~n~0 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16409#false} is VALID [2022-04-15 06:18:00,718 INFO L272 TraceCheckUtils]: 110: Hoare triple {16409#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16409#false} is VALID [2022-04-15 06:18:00,718 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-15 06:18:00,718 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-15 06:18:00,718 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-15 06:18:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 220 proven. 100 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 06:18:00,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:18:01,180 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-15 06:18:01,180 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-15 06:18:01,180 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-15 06:18:01,180 INFO L272 TraceCheckUtils]: 110: Hoare triple {16409#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16409#false} is VALID [2022-04-15 06:18:01,181 INFO L290 TraceCheckUtils]: 109: Hoare triple {16475#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16409#false} is VALID [2022-04-15 06:18:01,181 INFO L290 TraceCheckUtils]: 108: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16475#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:18:01,182 INFO L290 TraceCheckUtils]: 107: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:01,182 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16408#true} {16470#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:01,182 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,182 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,182 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,183 INFO L272 TraceCheckUtils]: 102: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,183 INFO L290 TraceCheckUtils]: 101: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:01,183 INFO L290 TraceCheckUtils]: 100: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:01,184 INFO L290 TraceCheckUtils]: 99: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:01,184 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16408#true} {16465#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:01,185 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,185 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,185 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,185 INFO L272 TraceCheckUtils]: 94: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,185 INFO L290 TraceCheckUtils]: 93: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:01,186 INFO L290 TraceCheckUtils]: 92: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:01,186 INFO L290 TraceCheckUtils]: 91: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:01,187 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16408#true} {16460#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:01,187 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,187 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,187 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,187 INFO L272 TraceCheckUtils]: 86: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,187 INFO L290 TraceCheckUtils]: 85: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:01,188 INFO L290 TraceCheckUtils]: 84: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:01,188 INFO L290 TraceCheckUtils]: 83: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:01,189 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16408#true} {16455#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:01,189 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,189 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,189 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,189 INFO L272 TraceCheckUtils]: 78: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,190 INFO L290 TraceCheckUtils]: 77: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:01,190 INFO L290 TraceCheckUtils]: 76: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:01,190 INFO L290 TraceCheckUtils]: 75: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:01,191 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16408#true} {16450#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:01,191 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,191 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,191 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,191 INFO L272 TraceCheckUtils]: 70: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,192 INFO L290 TraceCheckUtils]: 69: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:01,192 INFO L290 TraceCheckUtils]: 68: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:01,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:01,193 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16408#true} {16445#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:01,193 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,193 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,194 INFO L272 TraceCheckUtils]: 62: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:01,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:01,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:01,195 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16408#true} {16440#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:01,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,195 INFO L272 TraceCheckUtils]: 54: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:01,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:01,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:01,197 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16408#true} {16435#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:01,197 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,197 INFO L272 TraceCheckUtils]: 46: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,197 INFO L290 TraceCheckUtils]: 45: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:01,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:01,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:01,198 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16408#true} {16430#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:01,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,198 INFO L272 TraceCheckUtils]: 38: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:01,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:01,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:01,200 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16408#true} {17062#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:01,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 06:18:01,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 06:18:01,206 INFO L272 TraceCheckUtils]: 30: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 06:18:01,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:01,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {16424#(<= main_~n~0 10)} ~i~1 := 0; {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:01,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#(<= main_~i~0 10)} assume !(~i~0 < ~n~0); {16424#(<= main_~n~0 10)} is VALID [2022-04-15 06:18:01,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {16422#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16423#(<= main_~i~0 10)} is VALID [2022-04-15 06:18:01,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {16422#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16422#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:01,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {16421#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16422#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:01,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {16421#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16421#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:01,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {16420#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16421#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:01,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {16420#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16420#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:01,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {16419#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16420#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:01,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {16419#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16419#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:01,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {16418#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16419#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:01,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {16418#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16418#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:01,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {16417#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16418#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:01,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {16417#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16417#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:01,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {16416#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16417#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:01,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {16416#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16416#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:01,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {16415#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16416#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:01,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {16415#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16415#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:01,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {16414#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16415#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:01,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {16414#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16414#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:01,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {16498#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16414#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:01,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {16498#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16498#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:01,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {16408#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16498#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:01,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {16408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16408#true} is VALID [2022-04-15 06:18:01,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-15 06:18:01,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-15 06:18:01,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 06:18:01,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#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(9, 2); {16408#true} is VALID [2022-04-15 06:18:01,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-15 06:18:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 220 proven. 100 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 06:18:01,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150221564] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:18:01,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:18:01,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 39 [2022-04-15 06:18:01,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:01,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1168253920] [2022-04-15 06:18:01,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1168253920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:01,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:01,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:18:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713619665] [2022-04-15 06:18:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 114 [2022-04-15 06:18:01,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:01,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:01,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:01,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:18:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:01,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:18:01,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:18:01,285 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:02,329 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2022-04-15 06:18:02,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:18:02,329 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 114 [2022-04-15 06:18:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:18:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-15 06:18:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-15 06:18:02,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 106 transitions. [2022-04-15 06:18:02,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:02,423 INFO L225 Difference]: With dead ends: 172 [2022-04-15 06:18:02,423 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 06:18:02,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=682, Invalid=3100, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:18:02,424 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:18:02,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 65 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:18:02,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 06:18:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-15 06:18:02,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:18:02,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:18:02,490 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:18:02,490 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:18:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:02,491 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-15 06:18:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-15 06:18:02,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:02,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:02,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-15 06:18:02,492 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-15 06:18:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:02,493 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-15 06:18:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-15 06:18:02,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:02,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:02,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:18:02,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:18:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:18:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-15 06:18:02,495 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-04-15 06:18:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:18:02,495 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-15 06:18:02,495 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:02,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-15 06:18:02,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 06:18:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 06:18:02,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:18:02,679 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:18:02,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 06:18:02,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 06:18:02,880 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:18:02,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:18:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 39 times [2022-04-15 06:18:02,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:02,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893943215] [2022-04-15 06:18:02,882 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:18:02,882 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:18:02,882 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:18:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 40 times [2022-04-15 06:18:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:18:02,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017251490] [2022-04-15 06:18:02,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:18:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:18:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {18113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {18041#true} is VALID [2022-04-15 06:18:03,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-15 06:18:03,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 06:18:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} #68#return; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:18:03,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 06:18:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:18:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 06:18:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 06:18:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:18:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:03,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-15 06:18:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-15 06:18:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:03,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-15 06:18:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-15 06:18:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:03,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {18041#true} call ULTIMATE.init(); {18113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:18:03,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {18113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {18041#true} is VALID [2022-04-15 06:18:03,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-15 06:18:03,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-15 06:18:03,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {18041#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18041#true} is VALID [2022-04-15 06:18:03,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {18041#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {18046#(= main_~i~0 0)} is VALID [2022-04-15 06:18:03,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {18046#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18046#(= main_~i~0 0)} is VALID [2022-04-15 06:18:03,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {18046#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:18:03,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:18:03,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:18:03,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:18:03,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:18:03,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:18:03,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:18:03,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:18:03,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:18:03,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:18:03,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:18:03,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:18:03,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:18:03,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:18:03,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:18:03,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:18:03,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:18:03,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:18:03,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18056#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:18:03,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {18056#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18057#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:18:03,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {18057#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} is VALID [2022-04-15 06:18:03,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} assume !(~i~0 < ~n~0); {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} is VALID [2022-04-15 06:18:03,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} ~i~1 := 0; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:18:03,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:18:03,357 INFO L272 TraceCheckUtils]: 32: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,358 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18041#true} {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} #68#return; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:18:03,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} havoc #t~mem5; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:18:03,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:03,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:03,359 INFO L272 TraceCheckUtils]: 40: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,359 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18041#true} {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:03,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:03,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,361 INFO L272 TraceCheckUtils]: 48: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,361 INFO L290 TraceCheckUtils]: 51: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,361 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18041#true} {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:03,363 INFO L290 TraceCheckUtils]: 55: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:03,363 INFO L272 TraceCheckUtils]: 56: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,363 INFO L290 TraceCheckUtils]: 57: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,363 INFO L290 TraceCheckUtils]: 59: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,363 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18041#true} {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:03,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:03,364 INFO L290 TraceCheckUtils]: 62: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:03,364 INFO L290 TraceCheckUtils]: 63: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:03,364 INFO L272 TraceCheckUtils]: 64: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,365 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18041#true} {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:03,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:03,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:03,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:03,366 INFO L272 TraceCheckUtils]: 72: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,366 INFO L290 TraceCheckUtils]: 73: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,366 INFO L290 TraceCheckUtils]: 74: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,366 INFO L290 TraceCheckUtils]: 75: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,367 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {18041#true} {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:03,367 INFO L290 TraceCheckUtils]: 77: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:03,367 INFO L290 TraceCheckUtils]: 78: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,368 INFO L290 TraceCheckUtils]: 79: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,368 INFO L272 TraceCheckUtils]: 80: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,368 INFO L290 TraceCheckUtils]: 81: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,368 INFO L290 TraceCheckUtils]: 82: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,368 INFO L290 TraceCheckUtils]: 83: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,368 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18041#true} {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,369 INFO L290 TraceCheckUtils]: 85: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,369 INFO L290 TraceCheckUtils]: 86: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:03,369 INFO L290 TraceCheckUtils]: 87: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:03,370 INFO L272 TraceCheckUtils]: 88: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,370 INFO L290 TraceCheckUtils]: 89: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,370 INFO L290 TraceCheckUtils]: 90: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,370 INFO L290 TraceCheckUtils]: 91: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,370 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18041#true} {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:03,370 INFO L290 TraceCheckUtils]: 93: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:03,371 INFO L290 TraceCheckUtils]: 94: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:03,371 INFO L290 TraceCheckUtils]: 95: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:03,371 INFO L272 TraceCheckUtils]: 96: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,371 INFO L290 TraceCheckUtils]: 97: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,371 INFO L290 TraceCheckUtils]: 98: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,371 INFO L290 TraceCheckUtils]: 99: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,372 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18041#true} {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:03,372 INFO L290 TraceCheckUtils]: 101: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:03,373 INFO L290 TraceCheckUtils]: 102: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:03,373 INFO L290 TraceCheckUtils]: 103: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:03,373 INFO L272 TraceCheckUtils]: 104: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 06:18:03,373 INFO L290 TraceCheckUtils]: 105: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 06:18:03,373 INFO L290 TraceCheckUtils]: 106: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 06:18:03,373 INFO L290 TraceCheckUtils]: 107: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:03,374 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18041#true} {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:03,374 INFO L290 TraceCheckUtils]: 109: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:03,374 INFO L290 TraceCheckUtils]: 110: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18109#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:03,375 INFO L290 TraceCheckUtils]: 111: Hoare triple {18109#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18110#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:18:03,375 INFO L272 TraceCheckUtils]: 112: Hoare triple {18110#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:18:03,375 INFO L290 TraceCheckUtils]: 113: Hoare triple {18111#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18112#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:18:03,376 INFO L290 TraceCheckUtils]: 114: Hoare triple {18112#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18042#false} is VALID [2022-04-15 06:18:03,376 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-15 06:18:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 20 proven. 321 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 06:18:03,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:18:03,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017251490] [2022-04-15 06:18:03,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017251490] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:18:03,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846239658] [2022-04-15 06:18:03,377 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:18:03,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:03,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:18:03,377 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:18:03,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 06:18:03,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:18:03,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:18:03,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 06:18:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:03,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:03,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:18:11,964 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:18:11,964 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 23 treesize of output 10 [2022-04-15 06:18:12,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {18041#true} call ULTIMATE.init(); {18041#true} is VALID [2022-04-15 06:18:12,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#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(9, 2); {18041#true} is VALID [2022-04-15 06:18:12,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 06:18:12,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-15 06:18:12,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-15 06:18:12,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {18041#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18041#true} is VALID [2022-04-15 06:18:12,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {18041#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {18135#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:12,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {18135#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18135#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:12,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {18135#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18142#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:12,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {18142#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18142#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:12,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {18142#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18149#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:12,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {18149#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18149#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:12,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {18149#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18156#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:12,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {18156#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18156#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:12,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {18156#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18163#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:12,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {18163#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18163#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:12,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {18163#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18170#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:12,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {18170#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18170#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:12,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {18170#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18177#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:12,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {18177#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18177#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:12,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {18177#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18184#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:12,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {18184#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18184#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:12,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {18184#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18191#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:12,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {18191#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18191#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:12,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {18191#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18198#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:12,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {18198#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18198#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:12,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {18198#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18205#(<= main_~i~0 10)} is VALID [2022-04-15 06:18:12,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {18205#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18209#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10))} is VALID [2022-04-15 06:18:12,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {18209#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18213#(exists ((v_main_~i~0_243 Int)) (and (<= main_~i~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} is VALID [2022-04-15 06:18:12,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {18213#(exists ((v_main_~i~0_243 Int)) (and (<= main_~i~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} assume !(~i~0 < ~n~0); {18217#(exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} is VALID [2022-04-15 06:18:12,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {18217#(exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} ~i~1 := 0; {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,110 INFO L272 TraceCheckUtils]: 32: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,118 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,121 INFO L272 TraceCheckUtils]: 40: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,128 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:18:12,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:18:12,131 INFO L272 TraceCheckUtils]: 48: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,137 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} #68#return; {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:18:12,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} havoc #t~mem5; {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:18:12,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:18:12,139 INFO L290 TraceCheckUtils]: 55: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:18:12,140 INFO L272 TraceCheckUtils]: 56: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,143 INFO L290 TraceCheckUtils]: 59: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,144 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} #68#return; {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:18:12,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} havoc #t~mem5; {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:18:12,145 INFO L290 TraceCheckUtils]: 62: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:18:12,146 INFO L290 TraceCheckUtils]: 63: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:18:12,147 INFO L272 TraceCheckUtils]: 64: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,149 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} #68#return; {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:18:12,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} havoc #t~mem5; {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:18:12,150 INFO L290 TraceCheckUtils]: 70: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,151 INFO L290 TraceCheckUtils]: 71: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,152 INFO L272 TraceCheckUtils]: 72: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,154 INFO L290 TraceCheckUtils]: 74: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,155 INFO L290 TraceCheckUtils]: 75: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,155 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,156 INFO L290 TraceCheckUtils]: 77: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,157 INFO L290 TraceCheckUtils]: 79: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,158 INFO L272 TraceCheckUtils]: 80: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,172 INFO L290 TraceCheckUtils]: 82: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,174 INFO L290 TraceCheckUtils]: 83: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,175 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,175 INFO L290 TraceCheckUtils]: 85: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,176 INFO L290 TraceCheckUtils]: 86: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,177 INFO L290 TraceCheckUtils]: 87: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,178 INFO L272 TraceCheckUtils]: 88: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,186 INFO L290 TraceCheckUtils]: 90: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,189 INFO L290 TraceCheckUtils]: 91: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,190 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,190 INFO L290 TraceCheckUtils]: 93: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,191 INFO L290 TraceCheckUtils]: 94: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,192 INFO L290 TraceCheckUtils]: 95: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,192 INFO L272 TraceCheckUtils]: 96: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,193 INFO L290 TraceCheckUtils]: 97: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,202 INFO L290 TraceCheckUtils]: 98: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,203 INFO L290 TraceCheckUtils]: 99: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,204 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,204 INFO L290 TraceCheckUtils]: 101: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,205 INFO L290 TraceCheckUtils]: 102: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:18:12,206 INFO L290 TraceCheckUtils]: 103: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:18:12,206 INFO L272 TraceCheckUtils]: 104: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,207 INFO L290 TraceCheckUtils]: 105: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,207 INFO L290 TraceCheckUtils]: 106: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,213 INFO L290 TraceCheckUtils]: 107: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 06:18:12,214 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} #68#return; {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:18:12,215 INFO L290 TraceCheckUtils]: 109: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} havoc #t~mem5; {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:18:12,215 INFO L290 TraceCheckUtils]: 110: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18472#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 06:18:12,216 INFO L290 TraceCheckUtils]: 111: Hoare triple {18472#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18110#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:18:12,216 INFO L272 TraceCheckUtils]: 112: Hoare triple {18110#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18479#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:18:12,216 INFO L290 TraceCheckUtils]: 113: Hoare triple {18479#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18483#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:18:12,217 INFO L290 TraceCheckUtils]: 114: Hoare triple {18483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18042#false} is VALID [2022-04-15 06:18:12,217 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-15 06:18:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 190 proven. 151 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 06:18:12,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:18:12,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846239658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:18:12,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:18:12,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 58 [2022-04-15 06:18:12,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:12,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893943215] [2022-04-15 06:18:12,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893943215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:12,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:12,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:18:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021591325] [2022-04-15 06:18:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:12,521 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 116 [2022-04-15 06:18:12,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:12,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:12,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:12,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:18:12,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:18:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3195, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:18:12,577 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:16,619 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2022-04-15 06:18:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:18:16,619 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 116 [2022-04-15 06:18:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:18:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-15 06:18:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-15 06:18:16,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 103 transitions. [2022-04-15 06:18:16,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:16,715 INFO L225 Difference]: With dead ends: 132 [2022-04-15 06:18:16,715 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 06:18:16,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 96 SyntacticMatches, 20 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=575, Invalid=7081, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 06:18:16,716 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:18:16,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 153 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:18:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 06:18:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-15 06:18:16,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:18:16,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:18:16,787 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:18:16,787 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:18:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:16,788 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-15 06:18:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-15 06:18:16,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:16,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:16,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-15 06:18:16,789 INFO L87 Difference]: Start difference. First operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-15 06:18:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:16,790 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-15 06:18:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-15 06:18:16,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:16,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:16,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:18:16,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:18:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:18:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-15 06:18:16,792 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2022-04-15 06:18:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:18:16,792 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-15 06:18:16,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 06:18:16,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-15 06:18:16,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-15 06:18:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 06:18:16,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:18:16,985 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:18:17,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 06:18:17,185 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 06:18:17,185 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:18:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:18:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 41 times [2022-04-15 06:18:17,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:17,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [887189191] [2022-04-15 06:18:17,187 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:18:17,188 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:18:17,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:18:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 42 times [2022-04-15 06:18:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:18:17,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668949774] [2022-04-15 06:18:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:17,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:18:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:18:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {19423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {19349#true} is VALID [2022-04-15 06:18:17,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-15 06:18:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 06:18:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} #68#return; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 06:18:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19372#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:18:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19377#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 06:18:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19382#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:17,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 06:18:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19387#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:17,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:18:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19392#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:17,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-15 06:18:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19397#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:17,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-15 06:18:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19402#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-15 06:18:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19407#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:17,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-15 06:18:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19412#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-15 06:18:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19417#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:17,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:18:17,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {19423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {19349#true} is VALID [2022-04-15 06:18:17,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-15 06:18:17,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-15 06:18:17,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {19349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19349#true} is VALID [2022-04-15 06:18:17,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {19349#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {19354#(= main_~i~0 0)} is VALID [2022-04-15 06:18:17,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {19354#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19354#(= main_~i~0 0)} is VALID [2022-04-15 06:18:17,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {19354#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19355#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:17,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {19355#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19355#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:17,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {19355#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19356#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:17,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19356#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:17,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {19356#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19357#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:17,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {19357#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19357#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:17,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {19357#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19358#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:17,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {19358#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19358#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:17,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {19358#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19359#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:17,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {19359#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19359#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:17,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {19359#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19360#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:17,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {19360#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19360#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:17,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {19360#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19361#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:17,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {19361#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19361#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:17,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {19361#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19362#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:17,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {19362#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19362#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:17,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {19362#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19363#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:17,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {19363#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19363#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:17,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {19363#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19364#(<= main_~i~0 10)} is VALID [2022-04-15 06:18:17,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {19364#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19364#(<= main_~i~0 10)} is VALID [2022-04-15 06:18:17,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {19364#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19365#(<= main_~i~0 11)} is VALID [2022-04-15 06:18:17,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {19365#(<= main_~i~0 11)} assume !(~i~0 < ~n~0); {19366#(<= main_~n~0 11)} is VALID [2022-04-15 06:18:17,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {19366#(<= main_~n~0 11)} ~i~1 := 0; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:17,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:17,513 INFO L272 TraceCheckUtils]: 32: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,514 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19349#true} {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} #68#return; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:17,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} havoc #t~mem5; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:17,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:17,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:17,515 INFO L272 TraceCheckUtils]: 40: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,515 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19349#true} {19372#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:17,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:17,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:17,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:17,516 INFO L272 TraceCheckUtils]: 48: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,516 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,517 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19349#true} {19377#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:17,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:17,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:17,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:17,518 INFO L272 TraceCheckUtils]: 56: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,518 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,518 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19349#true} {19382#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:17,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:17,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:17,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:17,519 INFO L272 TraceCheckUtils]: 64: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,519 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,519 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,519 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,519 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19349#true} {19387#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:17,520 INFO L290 TraceCheckUtils]: 69: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:17,520 INFO L290 TraceCheckUtils]: 70: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:17,520 INFO L290 TraceCheckUtils]: 71: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:17,520 INFO L272 TraceCheckUtils]: 72: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,520 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,520 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,521 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,521 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19349#true} {19392#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:17,521 INFO L290 TraceCheckUtils]: 77: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:17,521 INFO L290 TraceCheckUtils]: 78: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:17,522 INFO L290 TraceCheckUtils]: 79: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:17,522 INFO L272 TraceCheckUtils]: 80: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,522 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,522 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,522 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,522 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {19349#true} {19397#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:17,522 INFO L290 TraceCheckUtils]: 85: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:17,523 INFO L290 TraceCheckUtils]: 86: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:17,523 INFO L290 TraceCheckUtils]: 87: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:17,523 INFO L272 TraceCheckUtils]: 88: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,523 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,523 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,523 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,524 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19349#true} {19402#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:17,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:17,524 INFO L290 TraceCheckUtils]: 94: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:17,524 INFO L290 TraceCheckUtils]: 95: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:17,524 INFO L272 TraceCheckUtils]: 96: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,524 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,525 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,525 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,525 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {19349#true} {19407#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:17,525 INFO L290 TraceCheckUtils]: 101: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:17,525 INFO L290 TraceCheckUtils]: 102: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:17,526 INFO L290 TraceCheckUtils]: 103: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:17,526 INFO L272 TraceCheckUtils]: 104: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,526 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,526 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,526 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,526 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19349#true} {19412#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:17,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:17,527 INFO L290 TraceCheckUtils]: 110: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:17,527 INFO L290 TraceCheckUtils]: 111: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:17,527 INFO L272 TraceCheckUtils]: 112: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:17,527 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:17,527 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:17,527 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:17,528 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19349#true} {19417#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:17,528 INFO L290 TraceCheckUtils]: 117: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:17,528 INFO L290 TraceCheckUtils]: 118: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19422#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:18:17,528 INFO L290 TraceCheckUtils]: 119: Hoare triple {19422#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19350#false} is VALID [2022-04-15 06:18:17,529 INFO L272 TraceCheckUtils]: 120: Hoare triple {19350#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19350#false} is VALID [2022-04-15 06:18:17,529 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-15 06:18:17,529 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-15 06:18:17,529 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-15 06:18:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 223 proven. 162 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 06:18:17,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:18:17,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668949774] [2022-04-15 06:18:17,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668949774] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:18:17,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260301665] [2022-04-15 06:18:17,529 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:18:17,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:17,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:18:17,540 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:18:17,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 06:18:17,735 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-15 06:18:17,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:18:17,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 06:18:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:17,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:18,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-15 06:18:18,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#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(9, 2); {19349#true} is VALID [2022-04-15 06:18:18,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-15 06:18:18,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-15 06:18:18,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {19349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19349#true} is VALID [2022-04-15 06:18:18,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {19349#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {19445#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:18,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {19445#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19445#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:18,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {19445#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19355#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:18,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {19355#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19355#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:18,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {19355#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19356#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:18,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19356#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:18,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {19356#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19357#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:18,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {19357#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19357#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:18,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {19357#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19358#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:18,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {19358#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19358#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:18,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {19358#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19359#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:18,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {19359#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19359#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:18,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {19359#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19360#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:18,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {19360#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19360#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:18,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {19360#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19361#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:18,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {19361#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19361#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:18,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {19361#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19362#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:18,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {19362#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19362#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:18,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {19362#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19363#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:18,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {19363#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19363#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:18,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {19363#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19364#(<= main_~i~0 10)} is VALID [2022-04-15 06:18:18,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {19364#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19364#(<= main_~i~0 10)} is VALID [2022-04-15 06:18:18,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {19364#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19365#(<= main_~i~0 11)} is VALID [2022-04-15 06:18:18,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {19365#(<= main_~i~0 11)} assume !(~i~0 < ~n~0); {19366#(<= main_~n~0 11)} is VALID [2022-04-15 06:18:18,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {19366#(<= main_~n~0 11)} ~i~1 := 0; {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,668 INFO L272 TraceCheckUtils]: 32: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,668 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19349#true} {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} #68#return; {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,670 INFO L272 TraceCheckUtils]: 40: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,670 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19349#true} {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} #68#return; {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,671 INFO L272 TraceCheckUtils]: 48: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,672 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19349#true} {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} #68#return; {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,672 INFO L290 TraceCheckUtils]: 53: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,673 INFO L290 TraceCheckUtils]: 54: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,673 INFO L290 TraceCheckUtils]: 55: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,673 INFO L272 TraceCheckUtils]: 56: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,673 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,673 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,674 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19349#true} {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} #68#return; {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,674 INFO L290 TraceCheckUtils]: 61: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,674 INFO L290 TraceCheckUtils]: 62: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,675 INFO L290 TraceCheckUtils]: 63: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,675 INFO L272 TraceCheckUtils]: 64: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,675 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19349#true} {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} #68#return; {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,676 INFO L290 TraceCheckUtils]: 69: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,676 INFO L290 TraceCheckUtils]: 70: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,677 INFO L290 TraceCheckUtils]: 71: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,677 INFO L272 TraceCheckUtils]: 72: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,677 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,677 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,677 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19349#true} {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} #68#return; {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,678 INFO L290 TraceCheckUtils]: 77: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,678 INFO L290 TraceCheckUtils]: 78: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,678 INFO L290 TraceCheckUtils]: 79: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,679 INFO L272 TraceCheckUtils]: 80: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,679 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,679 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,679 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,679 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {19349#true} {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} #68#return; {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,679 INFO L290 TraceCheckUtils]: 85: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,680 INFO L290 TraceCheckUtils]: 86: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,680 INFO L290 TraceCheckUtils]: 87: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,680 INFO L272 TraceCheckUtils]: 88: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,680 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,680 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,680 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,681 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19349#true} {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} #68#return; {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,681 INFO L290 TraceCheckUtils]: 93: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,682 INFO L290 TraceCheckUtils]: 94: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,682 INFO L290 TraceCheckUtils]: 95: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,682 INFO L272 TraceCheckUtils]: 96: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,682 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,682 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,682 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,683 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {19349#true} {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} #68#return; {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,683 INFO L290 TraceCheckUtils]: 101: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,683 INFO L290 TraceCheckUtils]: 102: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,684 INFO L290 TraceCheckUtils]: 103: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,684 INFO L272 TraceCheckUtils]: 104: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,684 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,684 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,684 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,684 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19349#true} {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} #68#return; {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,685 INFO L290 TraceCheckUtils]: 109: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,685 INFO L290 TraceCheckUtils]: 110: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,686 INFO L290 TraceCheckUtils]: 111: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,686 INFO L272 TraceCheckUtils]: 112: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:18,686 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:18,686 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:18,686 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:18,686 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19349#true} {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} #68#return; {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,687 INFO L290 TraceCheckUtils]: 117: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,687 INFO L290 TraceCheckUtils]: 118: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19793#(and (<= 11 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 06:18:18,687 INFO L290 TraceCheckUtils]: 119: Hoare triple {19793#(and (<= 11 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19350#false} is VALID [2022-04-15 06:18:18,687 INFO L272 TraceCheckUtils]: 120: Hoare triple {19350#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19350#false} is VALID [2022-04-15 06:18:18,688 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-15 06:18:18,688 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-15 06:18:18,688 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-15 06:18:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 264 proven. 121 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 06:18:18,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:18:19,220 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-15 06:18:19,221 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-15 06:18:19,221 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-15 06:18:19,221 INFO L272 TraceCheckUtils]: 120: Hoare triple {19350#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19350#false} is VALID [2022-04-15 06:18:19,221 INFO L290 TraceCheckUtils]: 119: Hoare triple {19422#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19350#false} is VALID [2022-04-15 06:18:19,221 INFO L290 TraceCheckUtils]: 118: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19422#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:18:19,222 INFO L290 TraceCheckUtils]: 117: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:19,222 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19349#true} {19417#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:19,222 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,222 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,222 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,222 INFO L272 TraceCheckUtils]: 112: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,223 INFO L290 TraceCheckUtils]: 111: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:19,223 INFO L290 TraceCheckUtils]: 110: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:18:19,223 INFO L290 TraceCheckUtils]: 109: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:19,224 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19349#true} {19412#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:19,224 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,224 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,224 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,224 INFO L272 TraceCheckUtils]: 104: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,224 INFO L290 TraceCheckUtils]: 103: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:19,225 INFO L290 TraceCheckUtils]: 102: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:18:19,225 INFO L290 TraceCheckUtils]: 101: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:19,226 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {19349#true} {19407#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:19,226 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,226 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,226 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,226 INFO L272 TraceCheckUtils]: 96: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,226 INFO L290 TraceCheckUtils]: 95: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:19,227 INFO L290 TraceCheckUtils]: 94: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:18:19,227 INFO L290 TraceCheckUtils]: 93: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:19,227 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19349#true} {19402#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:19,227 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,227 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,227 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,227 INFO L272 TraceCheckUtils]: 88: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,228 INFO L290 TraceCheckUtils]: 87: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:19,228 INFO L290 TraceCheckUtils]: 86: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:18:19,228 INFO L290 TraceCheckUtils]: 85: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:19,229 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {19349#true} {19397#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:19,229 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,229 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,229 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,229 INFO L272 TraceCheckUtils]: 80: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,229 INFO L290 TraceCheckUtils]: 79: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:19,230 INFO L290 TraceCheckUtils]: 78: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:18:19,230 INFO L290 TraceCheckUtils]: 77: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:19,230 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19349#true} {19392#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:19,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,231 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,231 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,231 INFO L272 TraceCheckUtils]: 72: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:19,231 INFO L290 TraceCheckUtils]: 70: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:18:19,232 INFO L290 TraceCheckUtils]: 69: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:19,232 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19349#true} {19387#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:19,232 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,232 INFO L272 TraceCheckUtils]: 64: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:19,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:18:19,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:19,234 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19349#true} {19382#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:19,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,234 INFO L272 TraceCheckUtils]: 56: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:19,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:18:19,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:19,235 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19349#true} {19377#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:19,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,236 INFO L272 TraceCheckUtils]: 48: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:19,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:18:19,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:19,237 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19349#true} {19372#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:19,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,237 INFO L272 TraceCheckUtils]: 40: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:19,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:18:19,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:18:19,239 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19349#true} {20064#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:18:19,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 06:18:19,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 06:18:19,239 INFO L272 TraceCheckUtils]: 32: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 06:18:19,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:18:19,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {19366#(<= main_~n~0 11)} ~i~1 := 0; {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:18:19,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {19365#(<= main_~i~0 11)} assume !(~i~0 < ~n~0); {19366#(<= main_~n~0 11)} is VALID [2022-04-15 06:18:19,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {19364#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19365#(<= main_~i~0 11)} is VALID [2022-04-15 06:18:19,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {19364#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19364#(<= main_~i~0 10)} is VALID [2022-04-15 06:18:19,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {19363#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19364#(<= main_~i~0 10)} is VALID [2022-04-15 06:18:19,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {19363#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19363#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:19,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {19362#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19363#(<= main_~i~0 9)} is VALID [2022-04-15 06:18:19,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {19362#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19362#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:19,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {19361#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19362#(<= main_~i~0 8)} is VALID [2022-04-15 06:18:19,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {19361#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19361#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:19,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {19360#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19361#(<= main_~i~0 7)} is VALID [2022-04-15 06:18:19,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {19360#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19360#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:19,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {19359#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19360#(<= main_~i~0 6)} is VALID [2022-04-15 06:18:19,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {19359#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19359#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:19,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {19358#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19359#(<= main_~i~0 5)} is VALID [2022-04-15 06:18:19,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {19358#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19358#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:19,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {19357#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19358#(<= main_~i~0 4)} is VALID [2022-04-15 06:18:19,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {19357#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19357#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:19,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {19356#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19357#(<= main_~i~0 3)} is VALID [2022-04-15 06:18:19,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19356#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:19,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {19355#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19356#(<= main_~i~0 2)} is VALID [2022-04-15 06:18:19,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {19355#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19355#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:19,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {19445#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19355#(<= main_~i~0 1)} is VALID [2022-04-15 06:18:19,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {19445#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19445#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:19,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {19349#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {19445#(<= main_~i~0 0)} is VALID [2022-04-15 06:18:19,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {19349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19349#true} is VALID [2022-04-15 06:18:19,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-15 06:18:19,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-15 06:18:19,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 06:18:19,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#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(9, 2); {19349#true} is VALID [2022-04-15 06:18:19,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-15 06:18:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 264 proven. 121 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 06:18:19,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260301665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:18:19,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:18:19,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 42 [2022-04-15 06:18:19,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:18:19,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [887189191] [2022-04-15 06:18:19,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [887189191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:18:19,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:18:19,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:18:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303557561] [2022-04-15 06:18:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:18:19,249 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 124 [2022-04-15 06:18:19,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:18:19,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:18:19,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:19,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:18:19,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:19,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:18:19,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:18:19,316 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:18:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:20,347 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2022-04-15 06:18:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:18:20,347 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 124 [2022-04-15 06:18:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:18:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:18:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-15 06:18:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:18:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-15 06:18:20,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 113 transitions. [2022-04-15 06:18:20,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:20,443 INFO L225 Difference]: With dead ends: 186 [2022-04-15 06:18:20,443 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 06:18:20,444 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=790, Invalid=3632, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 06:18:20,444 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:18:20,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 62 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:18:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 06:18:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-04-15 06:18:20,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:18:20,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:18:20,512 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:18:20,512 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:18:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:20,514 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-15 06:18:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-15 06:18:20,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:20,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:20,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-15 06:18:20,514 INFO L87 Difference]: Start difference. First operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-15 06:18:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:18:20,516 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-15 06:18:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-15 06:18:20,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:18:20,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:18:20,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:18:20,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:18:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:18:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-04-15 06:18:20,518 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2022-04-15 06:18:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:18:20,518 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-04-15 06:18:20,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:18:20,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 130 transitions. [2022-04-15 06:18:20,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:18:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-15 06:18:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 06:18:20,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:18:20,716 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:18:20,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 06:18:20,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:20,917 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:18:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:18:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 43 times [2022-04-15 06:18:20,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:18:20,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1884348103] [2022-04-15 06:18:20,919 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:18:20,919 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:18:20,919 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:18:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 44 times [2022-04-15 06:18:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:18:20,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679396826] [2022-04-15 06:18:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:18:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:18:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:18:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {21199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {21121#true} is VALID [2022-04-15 06:18:21,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-15 06:18:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 06:18:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:18:21,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 06:18:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 06:18:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 06:18:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-15 06:18:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-15 06:18:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:18:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-15 06:18:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-15 06:18:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-15 06:18:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:21,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-15 06:18:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:21,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:18:21,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {21199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {21121#true} is VALID [2022-04-15 06:18:21,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-15 06:18:21,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-15 06:18:21,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21121#true} is VALID [2022-04-15 06:18:21,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {21121#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {21126#(= main_~i~0 0)} is VALID [2022-04-15 06:18:21,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21126#(= main_~i~0 0)} is VALID [2022-04-15 06:18:21,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {21126#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:18:21,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:18:21,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:18:21,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:18:21,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:18:21,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:18:21,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:18:21,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:18:21,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:18:21,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:18:21,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:18:21,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:18:21,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:18:21,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:18:21,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:18:21,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:18:21,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:18:21,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:18:21,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:18:21,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:18:21,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:18:21,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21138#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:18:21,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {21138#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 06:18:21,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} assume !(~i~0 < ~n~0); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 06:18:21,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} ~i~1 := 0; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:18:21,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:18:21,440 INFO L272 TraceCheckUtils]: 34: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,441 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21121#true} {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:18:21,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:18:21,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,442 INFO L272 TraceCheckUtils]: 42: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,442 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21121#true} {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:21,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:21,443 INFO L272 TraceCheckUtils]: 50: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,444 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21121#true} {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:21,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:18:21,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,445 INFO L272 TraceCheckUtils]: 58: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,446 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21121#true} {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,447 INFO L290 TraceCheckUtils]: 64: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:21,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:21,447 INFO L272 TraceCheckUtils]: 66: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,447 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,447 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,448 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21121#true} {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:21,448 INFO L290 TraceCheckUtils]: 71: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:18:21,448 INFO L290 TraceCheckUtils]: 72: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:21,449 INFO L290 TraceCheckUtils]: 73: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:21,449 INFO L272 TraceCheckUtils]: 74: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,449 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,449 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,449 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,449 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21121#true} {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:21,449 INFO L290 TraceCheckUtils]: 79: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:18:21,450 INFO L290 TraceCheckUtils]: 80: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:21,450 INFO L290 TraceCheckUtils]: 81: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:21,450 INFO L272 TraceCheckUtils]: 82: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,450 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,450 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,451 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,451 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21121#true} {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:21,451 INFO L290 TraceCheckUtils]: 87: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:18:21,452 INFO L290 TraceCheckUtils]: 88: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,452 INFO L290 TraceCheckUtils]: 89: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,452 INFO L272 TraceCheckUtils]: 90: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,452 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,452 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,453 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21121#true} {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,453 INFO L290 TraceCheckUtils]: 95: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,454 INFO L290 TraceCheckUtils]: 96: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:21,454 INFO L290 TraceCheckUtils]: 97: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:21,454 INFO L272 TraceCheckUtils]: 98: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,454 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,454 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,454 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,455 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21121#true} {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:21,455 INFO L290 TraceCheckUtils]: 103: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:18:21,455 INFO L290 TraceCheckUtils]: 104: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:21,456 INFO L290 TraceCheckUtils]: 105: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:21,456 INFO L272 TraceCheckUtils]: 106: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,456 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,456 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,456 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,456 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {21121#true} {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:21,457 INFO L290 TraceCheckUtils]: 111: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:18:21,457 INFO L290 TraceCheckUtils]: 112: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:21,457 INFO L290 TraceCheckUtils]: 113: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:21,457 INFO L272 TraceCheckUtils]: 114: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:18:21,458 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:18:21,458 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:18:21,458 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:18:21,458 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21121#true} {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:21,458 INFO L290 TraceCheckUtils]: 119: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:18:21,459 INFO L290 TraceCheckUtils]: 120: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:18:21,459 INFO L290 TraceCheckUtils]: 121: Hoare triple {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21196#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:18:21,460 INFO L272 TraceCheckUtils]: 122: Hoare triple {21196#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21197#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:18:21,460 INFO L290 TraceCheckUtils]: 123: Hoare triple {21197#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {21198#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:18:21,460 INFO L290 TraceCheckUtils]: 124: Hoare triple {21198#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21122#false} is VALID [2022-04-15 06:18:21,460 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-15 06:18:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 22 proven. 386 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 06:18:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:18:21,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679396826] [2022-04-15 06:18:21,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679396826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:18:21,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668681321] [2022-04-15 06:18:21,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:18:21,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:18:21,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:18:21,462 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:18:21,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 06:18:21,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:18:21,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:18:21,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 06:18:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:18:21,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:18:21,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:22:09,765 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 19 treesize of output 7 [2022-04-15 06:22:09,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-15 06:22:09,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#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(9, 2); {21121#true} is VALID [2022-04-15 06:22:09,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:09,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-15 06:22:09,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-15 06:22:09,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21121#true} is VALID [2022-04-15 06:22:09,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {21121#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {21126#(= main_~i~0 0)} is VALID [2022-04-15 06:22:09,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21126#(= main_~i~0 0)} is VALID [2022-04-15 06:22:09,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {21126#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:22:09,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:22:09,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:22:09,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:22:09,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:22:09,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:22:09,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:22:09,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:22:09,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:22:09,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:22:09,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:22:09,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:22:09,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:22:09,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:22:09,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:22:09,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:22:09,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:22:09,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:22:09,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:22:09,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:22:09,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:22:09,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 06:22:09,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 06:22:09,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} assume !(~i~0 < ~n~0); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 06:22:09,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} ~i~1 := 0; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,838 INFO L272 TraceCheckUtils]: 34: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,839 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,841 INFO L272 TraceCheckUtils]: 42: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,842 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,842 INFO L290 TraceCheckUtils]: 47: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,844 INFO L272 TraceCheckUtils]: 50: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,845 INFO L290 TraceCheckUtils]: 53: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,845 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,847 INFO L272 TraceCheckUtils]: 58: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,848 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,848 INFO L290 TraceCheckUtils]: 63: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,849 INFO L290 TraceCheckUtils]: 64: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,849 INFO L290 TraceCheckUtils]: 65: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,850 INFO L272 TraceCheckUtils]: 66: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,850 INFO L290 TraceCheckUtils]: 67: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,850 INFO L290 TraceCheckUtils]: 68: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,850 INFO L290 TraceCheckUtils]: 69: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,851 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,852 INFO L290 TraceCheckUtils]: 72: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,852 INFO L290 TraceCheckUtils]: 73: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,853 INFO L272 TraceCheckUtils]: 74: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,853 INFO L290 TraceCheckUtils]: 75: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,853 INFO L290 TraceCheckUtils]: 76: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,853 INFO L290 TraceCheckUtils]: 77: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,854 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,854 INFO L290 TraceCheckUtils]: 79: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,854 INFO L290 TraceCheckUtils]: 80: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,855 INFO L290 TraceCheckUtils]: 81: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,855 INFO L272 TraceCheckUtils]: 82: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,856 INFO L290 TraceCheckUtils]: 84: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,856 INFO L290 TraceCheckUtils]: 85: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,857 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,857 INFO L290 TraceCheckUtils]: 87: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,857 INFO L290 TraceCheckUtils]: 88: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,858 INFO L272 TraceCheckUtils]: 90: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,859 INFO L290 TraceCheckUtils]: 91: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,859 INFO L290 TraceCheckUtils]: 92: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,859 INFO L290 TraceCheckUtils]: 93: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,860 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,875 INFO L290 TraceCheckUtils]: 95: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,876 INFO L290 TraceCheckUtils]: 96: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,876 INFO L290 TraceCheckUtils]: 97: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,877 INFO L272 TraceCheckUtils]: 98: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,877 INFO L290 TraceCheckUtils]: 99: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,877 INFO L290 TraceCheckUtils]: 100: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,878 INFO L290 TraceCheckUtils]: 101: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,878 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,878 INFO L290 TraceCheckUtils]: 103: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,879 INFO L290 TraceCheckUtils]: 104: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-15 06:22:09,879 INFO L290 TraceCheckUtils]: 105: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-15 06:22:09,880 INFO L272 TraceCheckUtils]: 106: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,880 INFO L290 TraceCheckUtils]: 107: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,880 INFO L290 TraceCheckUtils]: 108: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,881 INFO L290 TraceCheckUtils]: 109: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,881 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} #68#return; {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-15 06:22:09,882 INFO L290 TraceCheckUtils]: 111: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} havoc #t~mem5; {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-15 06:22:09,882 INFO L290 TraceCheckUtils]: 112: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,882 INFO L290 TraceCheckUtils]: 113: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,883 INFO L272 TraceCheckUtils]: 114: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,883 INFO L290 TraceCheckUtils]: 115: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,883 INFO L290 TraceCheckUtils]: 116: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,884 INFO L290 TraceCheckUtils]: 117: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 06:22:09,884 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,885 INFO L290 TraceCheckUtils]: 119: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,885 INFO L290 TraceCheckUtils]: 120: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21574#(and (= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 06:22:09,885 INFO L290 TraceCheckUtils]: 121: Hoare triple {21574#(and (= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21196#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:22:09,886 INFO L272 TraceCheckUtils]: 122: Hoare triple {21196#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:22:09,886 INFO L290 TraceCheckUtils]: 123: Hoare triple {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:22:09,886 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-15 06:22:09,886 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-15 06:22:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 06:22:09,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:22:12,230 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 16 treesize of output 14 [2022-04-15 06:22:12,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-15 06:22:12,407 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-15 06:22:12,407 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-15 06:22:12,408 INFO L290 TraceCheckUtils]: 123: Hoare triple {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:22:12,408 INFO L272 TraceCheckUtils]: 122: Hoare triple {21196#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:22:12,409 INFO L290 TraceCheckUtils]: 121: Hoare triple {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21196#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:22:12,409 INFO L290 TraceCheckUtils]: 120: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,409 INFO L290 TraceCheckUtils]: 119: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:22:12,410 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21121#true} {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:22:12,410 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,410 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,410 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,410 INFO L272 TraceCheckUtils]: 114: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,410 INFO L290 TraceCheckUtils]: 113: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:22:12,411 INFO L290 TraceCheckUtils]: 112: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:22:12,411 INFO L290 TraceCheckUtils]: 111: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:22:12,412 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {21121#true} {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:22:12,412 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,412 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,412 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,412 INFO L272 TraceCheckUtils]: 106: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,412 INFO L290 TraceCheckUtils]: 105: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:22:12,413 INFO L290 TraceCheckUtils]: 104: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:22:12,413 INFO L290 TraceCheckUtils]: 103: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:22:12,414 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21121#true} {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:22:12,414 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,414 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,414 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,414 INFO L272 TraceCheckUtils]: 98: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,414 INFO L290 TraceCheckUtils]: 97: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:22:12,415 INFO L290 TraceCheckUtils]: 96: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:22:12,415 INFO L290 TraceCheckUtils]: 95: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,415 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21121#true} {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,416 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,416 INFO L272 TraceCheckUtils]: 90: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,416 INFO L290 TraceCheckUtils]: 89: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,416 INFO L290 TraceCheckUtils]: 88: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,417 INFO L290 TraceCheckUtils]: 87: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:22:12,417 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21121#true} {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:22:12,417 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,417 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,417 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,418 INFO L272 TraceCheckUtils]: 82: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,418 INFO L290 TraceCheckUtils]: 81: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:22:12,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:22:12,419 INFO L290 TraceCheckUtils]: 79: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:22:12,419 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21121#true} {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:22:12,419 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,419 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,419 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,419 INFO L272 TraceCheckUtils]: 74: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,419 INFO L290 TraceCheckUtils]: 73: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:22:12,420 INFO L290 TraceCheckUtils]: 72: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:22:12,420 INFO L290 TraceCheckUtils]: 71: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:22:12,421 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21121#true} {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:22:12,421 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,421 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,421 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,421 INFO L272 TraceCheckUtils]: 66: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,421 INFO L290 TraceCheckUtils]: 65: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:22:12,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:22:12,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,423 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21121#true} {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,423 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,423 INFO L272 TraceCheckUtils]: 58: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:22:12,424 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21121#true} {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:22:12,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,425 INFO L272 TraceCheckUtils]: 50: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:22:12,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:22:12,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,426 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21121#true} {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,426 INFO L272 TraceCheckUtils]: 42: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,428 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21121#true} {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 06:22:12,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 06:22:12,428 INFO L272 TraceCheckUtils]: 34: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 06:22:12,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} ~i~1 := 0; {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:12,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} assume !(~i~0 < ~n~0); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 06:22:12,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 06:22:12,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 06:22:12,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:22:12,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:22:12,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:22:12,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:22:12,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:22:12,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:22:12,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:22:12,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:22:12,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:22:12,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:22:12,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:22:12,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:22:12,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:22:12,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:22:12,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:22:12,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:22:12,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:22:12,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:22:12,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:22:12,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:22:12,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {21126#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:22:12,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21126#(= main_~i~0 0)} is VALID [2022-04-15 06:22:12,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {21121#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {21126#(= main_~i~0 0)} is VALID [2022-04-15 06:22:12,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21121#true} is VALID [2022-04-15 06:22:12,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-15 06:22:12,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-15 06:22:12,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 06:22:12,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#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(9, 2); {21121#true} is VALID [2022-04-15 06:22:12,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-15 06:22:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 22 proven. 386 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 06:22:12,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668681321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:22:12,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:22:12,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 30] total 47 [2022-04-15 06:22:12,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:22:12,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1884348103] [2022-04-15 06:22:12,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1884348103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:22:12,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:22:12,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:22:12,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199981045] [2022-04-15 06:22:12,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:22:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 126 [2022-04-15 06:22:12,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:22:12,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:22:12,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:12,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:22:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:22:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2017, Unknown=12, NotChecked=0, Total=2162 [2022-04-15 06:22:12,504 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:22:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:17,148 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-04-15 06:22:17,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:22:17,148 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 126 [2022-04-15 06:22:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:22:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:22:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-15 06:22:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:22:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-15 06:22:17,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 110 transitions. [2022-04-15 06:22:17,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:17,250 INFO L225 Difference]: With dead ends: 142 [2022-04-15 06:22:17,250 INFO L226 Difference]: Without dead ends: 140 [2022-04-15 06:22:17,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 235 SyntacticMatches, 26 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 229.7s TimeCoverageRelationStatistics Valid=304, Invalid=5536, Unknown=12, NotChecked=0, Total=5852 [2022-04-15 06:22:17,251 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 85 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:22:17,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 172 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:22:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-15 06:22:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2022-04-15 06:22:17,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:22:17,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:17,347 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:17,347 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:17,348 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-15 06:22:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-15 06:22:17,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:17,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:17,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-15 06:22:17,349 INFO L87 Difference]: Start difference. First operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-15 06:22:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:17,350 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-15 06:22:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-15 06:22:17,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:17,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:17,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:22:17,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:22:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2022-04-15 06:22:17,353 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2022-04-15 06:22:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:22:17,353 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2022-04-15 06:22:17,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:22:17,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 138 transitions. [2022-04-15 06:22:17,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 06:22:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 06:22:17,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:22:17,572 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:22:17,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 06:22:17,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:17,787 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:22:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:22:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 45 times [2022-04-15 06:22:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:17,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [180170885] [2022-04-15 06:22:17,789 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:22:17,789 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:22:17,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:22:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 46 times [2022-04-15 06:22:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:22:17,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530009230] [2022-04-15 06:22:17,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:22:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:22:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {22948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {22868#true} is VALID [2022-04-15 06:22:18,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-15 06:22:18,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 06:22:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} #68#return; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 06:22:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 06:22:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22892#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:18,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 06:22:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22897#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 06:22:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22902#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-15 06:22:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22907#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:18,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-15 06:22:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22912#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:18,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 06:22:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22917#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:18,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-15 06:22:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22922#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-15 06:22:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22927#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-15 06:22:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22932#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:18,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-15 06:22:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22937#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:18,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-15 06:22:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22942#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:18,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:22:18,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {22948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {22868#true} is VALID [2022-04-15 06:22:18,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-15 06:22:18,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-15 06:22:18,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {22868#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {22868#true} is VALID [2022-04-15 06:22:18,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {22868#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {22873#(= main_~i~0 0)} is VALID [2022-04-15 06:22:18,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {22873#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22873#(= main_~i~0 0)} is VALID [2022-04-15 06:22:18,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {22873#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22874#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:18,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {22874#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22874#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:18,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {22874#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22875#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:18,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {22875#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22875#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:18,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {22875#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22876#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:18,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {22876#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22876#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:18,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {22876#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22877#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:18,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {22877#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22877#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:18,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {22877#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22878#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:18,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {22878#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22878#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:18,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {22878#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22879#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:18,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {22879#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22879#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:18,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {22879#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22880#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:18,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {22880#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22880#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:18,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {22880#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22881#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:18,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {22881#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22881#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:18,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {22881#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22882#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:18,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {22882#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22882#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:18,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {22882#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22883#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:18,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {22883#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22883#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:18,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {22883#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22884#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:18,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {22884#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22884#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:18,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {22884#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22885#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:18,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {22885#(<= main_~i~0 12)} assume !(~i~0 < ~n~0); {22886#(<= main_~n~0 12)} is VALID [2022-04-15 06:22:18,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {22886#(<= main_~n~0 12)} ~i~1 := 0; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 06:22:18,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 06:22:18,154 INFO L272 TraceCheckUtils]: 34: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,155 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22868#true} {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} #68#return; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 06:22:18,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} havoc #t~mem5; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 06:22:18,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:18,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:18,156 INFO L272 TraceCheckUtils]: 42: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,156 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22868#true} {22892#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:18,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:18,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:18,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:18,157 INFO L272 TraceCheckUtils]: 50: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,157 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22868#true} {22897#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:18,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:18,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:18,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:18,158 INFO L272 TraceCheckUtils]: 58: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,159 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22868#true} {22902#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:18,159 INFO L290 TraceCheckUtils]: 63: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:18,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:18,160 INFO L290 TraceCheckUtils]: 65: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:18,160 INFO L272 TraceCheckUtils]: 66: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,160 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,160 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {22868#true} {22907#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:18,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:18,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:18,161 INFO L290 TraceCheckUtils]: 73: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:18,161 INFO L272 TraceCheckUtils]: 74: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,161 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,162 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22868#true} {22912#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:18,162 INFO L290 TraceCheckUtils]: 79: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:18,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:18,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:18,163 INFO L272 TraceCheckUtils]: 82: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,163 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,163 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,163 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,163 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22868#true} {22917#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:18,163 INFO L290 TraceCheckUtils]: 87: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:18,164 INFO L290 TraceCheckUtils]: 88: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:18,164 INFO L290 TraceCheckUtils]: 89: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:18,164 INFO L272 TraceCheckUtils]: 90: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,164 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,164 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,164 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,164 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22868#true} {22922#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:18,165 INFO L290 TraceCheckUtils]: 95: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:18,165 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:18,165 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:18,165 INFO L272 TraceCheckUtils]: 98: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,165 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,165 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,165 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,166 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22868#true} {22927#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:18,166 INFO L290 TraceCheckUtils]: 103: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:18,166 INFO L290 TraceCheckUtils]: 104: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:18,167 INFO L290 TraceCheckUtils]: 105: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:18,167 INFO L272 TraceCheckUtils]: 106: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,167 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,167 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,167 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,167 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {22868#true} {22932#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:18,167 INFO L290 TraceCheckUtils]: 111: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:18,168 INFO L290 TraceCheckUtils]: 112: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:18,168 INFO L290 TraceCheckUtils]: 113: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:18,168 INFO L272 TraceCheckUtils]: 114: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,168 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,168 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,168 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,169 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {22868#true} {22937#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:18,169 INFO L290 TraceCheckUtils]: 119: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:18,169 INFO L290 TraceCheckUtils]: 120: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:18,169 INFO L290 TraceCheckUtils]: 121: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:18,169 INFO L272 TraceCheckUtils]: 122: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:18,169 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:18,170 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:18,170 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:18,170 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22868#true} {22942#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:18,170 INFO L290 TraceCheckUtils]: 127: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:18,170 INFO L290 TraceCheckUtils]: 128: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22947#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:22:18,171 INFO L290 TraceCheckUtils]: 129: Hoare triple {22947#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22869#false} is VALID [2022-04-15 06:22:18,171 INFO L272 TraceCheckUtils]: 130: Hoare triple {22869#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22869#false} is VALID [2022-04-15 06:22:18,171 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-15 06:22:18,171 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-15 06:22:18,171 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-15 06:22:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 267 proven. 189 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 06:22:18,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:22:18,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530009230] [2022-04-15 06:22:18,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530009230] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:22:18,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464810458] [2022-04-15 06:22:18,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:22:18,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:18,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:22:18,188 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:22:18,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 06:22:18,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:22:18,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:22:18,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:22:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:18,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:22:19,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-15 06:22:19,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#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(9, 2); {22868#true} is VALID [2022-04-15 06:22:19,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-15 06:22:19,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-15 06:22:19,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {22868#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {22868#true} is VALID [2022-04-15 06:22:19,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {22868#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {22970#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:19,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {22970#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22970#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:19,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {22970#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22874#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:19,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {22874#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22874#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:19,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {22874#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22875#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:19,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {22875#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22875#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:19,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {22875#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22876#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:19,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {22876#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22876#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:19,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {22876#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22877#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:19,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {22877#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22877#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:19,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {22877#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22878#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:19,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {22878#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22878#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:19,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {22878#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22879#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:19,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {22879#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22879#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:19,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {22879#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22880#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:19,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {22880#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22880#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:19,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {22880#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22881#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:19,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {22881#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22881#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:19,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {22881#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22882#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:19,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {22882#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22882#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:19,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {22882#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22883#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:19,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {22883#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22883#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:19,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {22883#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22884#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:19,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {22884#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22884#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:19,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {22884#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22885#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:19,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {22885#(<= main_~i~0 12)} assume !(~i~0 < ~n~0); {22886#(<= main_~n~0 12)} is VALID [2022-04-15 06:22:19,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {22886#(<= main_~n~0 12)} ~i~1 := 0; {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,552 INFO L272 TraceCheckUtils]: 34: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,552 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22868#true} {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} #68#return; {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,561 INFO L272 TraceCheckUtils]: 42: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,562 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22868#true} {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} #68#return; {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,562 INFO L290 TraceCheckUtils]: 48: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,563 INFO L290 TraceCheckUtils]: 49: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,563 INFO L272 TraceCheckUtils]: 50: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,563 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,563 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22868#true} {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} #68#return; {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,564 INFO L290 TraceCheckUtils]: 55: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,564 INFO L290 TraceCheckUtils]: 56: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:19,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:19,564 INFO L272 TraceCheckUtils]: 58: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,564 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,564 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,564 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,565 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22868#true} {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} #68#return; {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:19,565 INFO L290 TraceCheckUtils]: 63: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} havoc #t~mem5; {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:19,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,566 INFO L272 TraceCheckUtils]: 66: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,566 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,566 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,567 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {22868#true} {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} #68#return; {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,567 INFO L290 TraceCheckUtils]: 71: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,567 INFO L290 TraceCheckUtils]: 72: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,568 INFO L290 TraceCheckUtils]: 73: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,568 INFO L272 TraceCheckUtils]: 74: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,568 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22868#true} {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} #68#return; {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,568 INFO L290 TraceCheckUtils]: 79: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,569 INFO L290 TraceCheckUtils]: 80: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,569 INFO L290 TraceCheckUtils]: 81: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,569 INFO L272 TraceCheckUtils]: 82: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,569 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,570 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22868#true} {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} #68#return; {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,570 INFO L290 TraceCheckUtils]: 87: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,570 INFO L290 TraceCheckUtils]: 88: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,571 INFO L290 TraceCheckUtils]: 89: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,571 INFO L272 TraceCheckUtils]: 90: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,571 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,571 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,571 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,571 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22868#true} {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} #68#return; {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,572 INFO L290 TraceCheckUtils]: 95: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,572 INFO L290 TraceCheckUtils]: 96: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,572 INFO L290 TraceCheckUtils]: 97: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,573 INFO L272 TraceCheckUtils]: 98: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,573 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,573 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,573 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,573 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22868#true} {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} #68#return; {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,573 INFO L290 TraceCheckUtils]: 103: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,574 INFO L290 TraceCheckUtils]: 104: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,574 INFO L290 TraceCheckUtils]: 105: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,574 INFO L272 TraceCheckUtils]: 106: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,574 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,574 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,574 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,575 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {22868#true} {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} #68#return; {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,575 INFO L290 TraceCheckUtils]: 111: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,575 INFO L290 TraceCheckUtils]: 112: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,576 INFO L290 TraceCheckUtils]: 113: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,576 INFO L272 TraceCheckUtils]: 114: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,576 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,576 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,576 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,576 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {22868#true} {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} #68#return; {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,577 INFO L290 TraceCheckUtils]: 119: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,577 INFO L290 TraceCheckUtils]: 120: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,577 INFO L290 TraceCheckUtils]: 121: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,577 INFO L272 TraceCheckUtils]: 122: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:19,577 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:19,578 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:19,578 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:19,578 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22868#true} {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} #68#return; {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,578 INFO L290 TraceCheckUtils]: 127: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 06:22:19,579 INFO L290 TraceCheckUtils]: 128: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23349#(and (<= main_~n~0 12) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:19,579 INFO L290 TraceCheckUtils]: 129: Hoare triple {23349#(and (<= main_~n~0 12) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22869#false} is VALID [2022-04-15 06:22:19,579 INFO L272 TraceCheckUtils]: 130: Hoare triple {22869#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22869#false} is VALID [2022-04-15 06:22:19,579 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-15 06:22:19,579 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-15 06:22:19,579 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-15 06:22:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 312 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 06:22:19,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:22:20,109 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-15 06:22:20,109 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-15 06:22:20,109 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-15 06:22:20,109 INFO L272 TraceCheckUtils]: 130: Hoare triple {22869#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22869#false} is VALID [2022-04-15 06:22:20,124 INFO L290 TraceCheckUtils]: 129: Hoare triple {22947#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22869#false} is VALID [2022-04-15 06:22:20,125 INFO L290 TraceCheckUtils]: 128: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22947#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:22:20,125 INFO L290 TraceCheckUtils]: 127: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:20,125 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22868#true} {22942#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:20,125 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,125 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,126 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,126 INFO L272 TraceCheckUtils]: 122: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,126 INFO L290 TraceCheckUtils]: 121: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:20,126 INFO L290 TraceCheckUtils]: 120: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:20,126 INFO L290 TraceCheckUtils]: 119: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:20,127 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {22868#true} {22937#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:20,127 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,127 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,127 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,127 INFO L272 TraceCheckUtils]: 114: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,127 INFO L290 TraceCheckUtils]: 113: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:20,128 INFO L290 TraceCheckUtils]: 112: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:20,128 INFO L290 TraceCheckUtils]: 111: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:20,128 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {22868#true} {22932#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:20,129 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,129 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,129 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,129 INFO L272 TraceCheckUtils]: 106: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,129 INFO L290 TraceCheckUtils]: 105: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:20,129 INFO L290 TraceCheckUtils]: 104: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:20,130 INFO L290 TraceCheckUtils]: 103: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:20,130 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22868#true} {22927#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:20,130 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,130 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,130 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,130 INFO L272 TraceCheckUtils]: 98: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,130 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:20,131 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:20,131 INFO L290 TraceCheckUtils]: 95: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:20,131 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22868#true} {22922#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:20,132 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,132 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,132 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,132 INFO L272 TraceCheckUtils]: 90: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,132 INFO L290 TraceCheckUtils]: 89: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:20,132 INFO L290 TraceCheckUtils]: 88: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:20,133 INFO L290 TraceCheckUtils]: 87: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:20,133 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22868#true} {22917#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:20,133 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,133 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,133 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,133 INFO L272 TraceCheckUtils]: 82: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,133 INFO L290 TraceCheckUtils]: 81: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:20,134 INFO L290 TraceCheckUtils]: 80: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:20,134 INFO L290 TraceCheckUtils]: 79: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:20,134 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22868#true} {22912#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:20,135 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,135 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,135 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,135 INFO L272 TraceCheckUtils]: 74: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,147 INFO L290 TraceCheckUtils]: 73: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:20,148 INFO L290 TraceCheckUtils]: 72: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:20,148 INFO L290 TraceCheckUtils]: 71: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:20,148 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {22868#true} {22907#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:20,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,148 INFO L272 TraceCheckUtils]: 66: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:20,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:20,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:20,150 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22868#true} {22902#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:20,150 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,150 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,150 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,150 INFO L272 TraceCheckUtils]: 58: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:20,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:20,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:20,151 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22868#true} {22897#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:20,151 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,151 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,152 INFO L272 TraceCheckUtils]: 50: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:20,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:20,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:20,153 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22868#true} {22892#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:20,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,153 INFO L272 TraceCheckUtils]: 42: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:20,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:20,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:20,154 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22868#true} {23644#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:20,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 06:22:20,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 06:22:20,155 INFO L272 TraceCheckUtils]: 34: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 06:22:20,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:20,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {22886#(<= main_~n~0 12)} ~i~1 := 0; {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:20,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {22885#(<= main_~i~0 12)} assume !(~i~0 < ~n~0); {22886#(<= main_~n~0 12)} is VALID [2022-04-15 06:22:20,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {22884#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22885#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:20,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {22884#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22884#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:20,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {22883#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22884#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:20,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {22883#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22883#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:20,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {22882#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22883#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:20,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {22882#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22882#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:20,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {22881#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22882#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:20,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {22881#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22881#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:20,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {22880#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22881#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:20,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {22880#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22880#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:20,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {22879#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22880#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:20,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {22879#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22879#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:20,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {22878#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22879#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:20,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {22878#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22878#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:20,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {22877#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22878#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:20,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {22877#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22877#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:20,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {22876#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22877#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:20,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {22876#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22876#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:20,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {22875#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22876#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:20,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {22875#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22875#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:20,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {22874#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22875#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:20,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {22874#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22874#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:20,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {22970#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22874#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:20,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {22970#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22970#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:20,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {22868#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {22970#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:20,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {22868#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {22868#true} is VALID [2022-04-15 06:22:20,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-15 06:22:20,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-15 06:22:20,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 06:22:20,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#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(9, 2); {22868#true} is VALID [2022-04-15 06:22:20,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-15 06:22:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 312 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 06:22:20,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464810458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:22:20,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:22:20,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 45 [2022-04-15 06:22:20,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:22:20,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [180170885] [2022-04-15 06:22:20,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [180170885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:22:20,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:22:20,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:22:20,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343275533] [2022-04-15 06:22:20,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:22:20,165 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 134 [2022-04-15 06:22:20,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:22:20,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:20,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:20,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:22:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:22:20,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:22:20,305 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:21,586 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2022-04-15 06:22:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:22:21,587 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 134 [2022-04-15 06:22:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:22:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-15 06:22:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-15 06:22:21,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 120 transitions. [2022-04-15 06:22:21,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:21,717 INFO L225 Difference]: With dead ends: 200 [2022-04-15 06:22:21,717 INFO L226 Difference]: Without dead ends: 140 [2022-04-15 06:22:21,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=906, Invalid=4206, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 06:22:21,718 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:22:21,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 74 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:22:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-15 06:22:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-04-15 06:22:21,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:22:21,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:21,816 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:21,816 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:21,818 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-15 06:22:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-15 06:22:21,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:21,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:21,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-15 06:22:21,818 INFO L87 Difference]: Start difference. First operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-15 06:22:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:21,819 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-15 06:22:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-15 06:22:21,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:21,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:21,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:22:21,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:22:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-04-15 06:22:21,821 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2022-04-15 06:22:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:22:21,822 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-04-15 06:22:21,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:21,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 140 transitions. [2022-04-15 06:22:22,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-04-15 06:22:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 06:22:22,044 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:22:22,044 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:22:22,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 06:22:22,244 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 06:22:22,244 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:22:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:22:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 47 times [2022-04-15 06:22:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:22,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866894662] [2022-04-15 06:22:22,246 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:22:22,246 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:22:22,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:22:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 48 times [2022-04-15 06:22:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:22:22,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941344284] [2022-04-15 06:22:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:22,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:22:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:22:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {24863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {24779#true} is VALID [2022-04-15 06:22:23,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-15 06:22:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 06:22:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 06:22:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 06:22:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:22:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 06:22:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} #68#return; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 06:22:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 06:22:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-15 06:22:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-15 06:22:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 06:22:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-15 06:22:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-15 06:22:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-15 06:22:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {24779#true} call ULTIMATE.init(); {24863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:22:23,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {24863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {24779#true} is VALID [2022-04-15 06:22:23,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-15 06:22:23,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-15 06:22:23,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {24779#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24779#true} is VALID [2022-04-15 06:22:23,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {24779#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 06:22:23,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 06:22:23,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:22:23,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:22:23,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:22:23,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:22:23,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:22:23,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:22:23,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:22:23,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:22:23,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:22:23,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:22:23,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:22:23,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:22:23,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} is VALID [2022-04-15 06:22:23,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} is VALID [2022-04-15 06:22:23,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:22:23,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:22:23,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:22:23,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:22:23,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:22:23,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:22:23,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:22:23,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:22:23,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24796#(and (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} is VALID [2022-04-15 06:22:23,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {24796#(and (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24797#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} is VALID [2022-04-15 06:22:23,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {24797#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !(~i~0 < ~n~0); {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} ~i~1 := 0; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,121 INFO L272 TraceCheckUtils]: 36: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,122 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24779#true} {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,123 INFO L272 TraceCheckUtils]: 44: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,123 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24779#true} {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,124 INFO L290 TraceCheckUtils]: 51: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,125 INFO L272 TraceCheckUtils]: 52: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,125 INFO L290 TraceCheckUtils]: 53: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,125 INFO L290 TraceCheckUtils]: 54: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,125 INFO L290 TraceCheckUtils]: 55: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,125 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {24779#true} {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,126 INFO L272 TraceCheckUtils]: 60: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,127 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24779#true} {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 06:22:23,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 06:22:23,136 INFO L272 TraceCheckUtils]: 68: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,136 INFO L290 TraceCheckUtils]: 71: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,138 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24779#true} {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} #68#return; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 06:22:23,138 INFO L290 TraceCheckUtils]: 73: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} havoc #t~mem5; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 06:22:23,139 INFO L290 TraceCheckUtils]: 74: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,139 INFO L272 TraceCheckUtils]: 76: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,139 INFO L290 TraceCheckUtils]: 78: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,139 INFO L290 TraceCheckUtils]: 79: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,140 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24779#true} {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,140 INFO L290 TraceCheckUtils]: 81: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,141 INFO L290 TraceCheckUtils]: 82: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,141 INFO L290 TraceCheckUtils]: 83: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,141 INFO L272 TraceCheckUtils]: 84: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,141 INFO L290 TraceCheckUtils]: 86: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,142 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {24779#true} {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,143 INFO L290 TraceCheckUtils]: 90: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,143 INFO L290 TraceCheckUtils]: 91: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,143 INFO L272 TraceCheckUtils]: 92: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,143 INFO L290 TraceCheckUtils]: 93: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,143 INFO L290 TraceCheckUtils]: 94: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,143 INFO L290 TraceCheckUtils]: 95: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,144 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {24779#true} {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,144 INFO L290 TraceCheckUtils]: 97: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,145 INFO L290 TraceCheckUtils]: 98: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,145 INFO L290 TraceCheckUtils]: 99: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,145 INFO L272 TraceCheckUtils]: 100: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,145 INFO L290 TraceCheckUtils]: 101: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,145 INFO L290 TraceCheckUtils]: 102: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,145 INFO L290 TraceCheckUtils]: 103: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,146 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {24779#true} {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,146 INFO L290 TraceCheckUtils]: 105: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,147 INFO L290 TraceCheckUtils]: 106: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,147 INFO L290 TraceCheckUtils]: 107: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,147 INFO L272 TraceCheckUtils]: 108: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,147 INFO L290 TraceCheckUtils]: 109: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,147 INFO L290 TraceCheckUtils]: 110: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,147 INFO L290 TraceCheckUtils]: 111: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,148 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {24779#true} {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,148 INFO L290 TraceCheckUtils]: 113: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,149 INFO L290 TraceCheckUtils]: 114: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,149 INFO L290 TraceCheckUtils]: 115: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,149 INFO L272 TraceCheckUtils]: 116: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,149 INFO L290 TraceCheckUtils]: 117: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,149 INFO L290 TraceCheckUtils]: 118: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,149 INFO L290 TraceCheckUtils]: 119: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,150 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {24779#true} {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,164 INFO L290 TraceCheckUtils]: 121: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,164 INFO L290 TraceCheckUtils]: 122: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,165 INFO L290 TraceCheckUtils]: 123: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,165 INFO L272 TraceCheckUtils]: 124: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 06:22:23,165 INFO L290 TraceCheckUtils]: 125: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 06:22:23,165 INFO L290 TraceCheckUtils]: 126: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 06:22:23,165 INFO L290 TraceCheckUtils]: 127: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:23,166 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {24779#true} {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,166 INFO L290 TraceCheckUtils]: 129: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 06:22:23,167 INFO L290 TraceCheckUtils]: 130: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24859#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= 48 (+ main_~x~0.offset (* main_~i~1 4))))} is VALID [2022-04-15 06:22:23,167 INFO L290 TraceCheckUtils]: 131: Hoare triple {24859#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= 48 (+ main_~x~0.offset (* main_~i~1 4))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24860#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:22:23,168 INFO L272 TraceCheckUtils]: 132: Hoare triple {24860#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24861#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:22:23,168 INFO L290 TraceCheckUtils]: 133: Hoare triple {24861#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24862#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:22:23,169 INFO L290 TraceCheckUtils]: 134: Hoare triple {24862#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24780#false} is VALID [2022-04-15 06:22:23,169 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-15 06:22:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 24 proven. 457 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 06:22:23,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:22:23,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941344284] [2022-04-15 06:22:23,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941344284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:22:23,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380789089] [2022-04-15 06:22:23,170 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:22:23,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:23,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:22:23,171 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:22:23,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 06:22:23,474 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-15 06:22:23,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:22:23,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 06:22:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:23,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:22:23,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:22:33,224 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:22:33,224 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 23 treesize of output 10 [2022-04-15 06:22:33,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {24779#true} call ULTIMATE.init(); {24779#true} is VALID [2022-04-15 06:22:33,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#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(9, 2); {24779#true} is VALID [2022-04-15 06:22:33,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 06:22:33,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-15 06:22:33,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-15 06:22:33,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {24779#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24779#true} is VALID [2022-04-15 06:22:33,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {24779#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {24885#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:33,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {24885#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24885#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:33,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {24885#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24892#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:33,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {24892#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24892#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:33,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {24892#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24899#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:33,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {24899#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24899#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:33,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {24899#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24906#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:33,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {24906#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24906#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:33,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {24906#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24913#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:33,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {24913#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24913#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:33,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {24913#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24920#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:33,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {24920#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24920#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:33,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {24920#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24927#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:33,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {24927#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24927#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:33,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {24927#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24934#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:33,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {24934#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24934#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:33,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {24934#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24941#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:33,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {24941#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24941#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:33,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {24941#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24948#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:33,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {24948#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24948#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:33,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {24948#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24955#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:33,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {24955#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24955#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:33,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {24955#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24962#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:33,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {24962#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24962#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:33,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {24962#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24969#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:33,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {24969#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24973#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 12))} is VALID [2022-04-15 06:22:33,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {24973#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24977#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~i~0 (+ v_main_~i~0_336 1))))} is VALID [2022-04-15 06:22:33,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {24977#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~i~0 (+ v_main_~i~0_336 1))))} assume !(~i~0 < ~n~0); {24981#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1))))} is VALID [2022-04-15 06:22:33,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {24981#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1))))} ~i~1 := 0; {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:22:33,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:22:33,341 INFO L272 TraceCheckUtils]: 36: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,343 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} #68#return; {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:22:33,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} havoc #t~mem5; {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-15 06:22:33,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-15 06:22:33,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-15 06:22:33,346 INFO L272 TraceCheckUtils]: 44: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,348 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} #68#return; {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-15 06:22:33,348 INFO L290 TraceCheckUtils]: 49: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} havoc #t~mem5; {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-15 06:22:33,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:33,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:33,352 INFO L272 TraceCheckUtils]: 52: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,353 INFO L290 TraceCheckUtils]: 54: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,353 INFO L290 TraceCheckUtils]: 55: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,354 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} #68#return; {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:33,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:33,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:33,355 INFO L290 TraceCheckUtils]: 59: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:33,357 INFO L272 TraceCheckUtils]: 60: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,358 INFO L290 TraceCheckUtils]: 63: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,359 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} #68#return; {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:33,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:33,360 INFO L290 TraceCheckUtils]: 66: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:33,360 INFO L290 TraceCheckUtils]: 67: Hoare triple {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:33,366 INFO L272 TraceCheckUtils]: 68: Hoare triple {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,366 INFO L290 TraceCheckUtils]: 69: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,367 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} #68#return; {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:33,367 INFO L290 TraceCheckUtils]: 73: Hoare triple {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} havoc #t~mem5; {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:33,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {25086#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:33,369 INFO L290 TraceCheckUtils]: 75: Hoare triple {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:33,371 INFO L272 TraceCheckUtils]: 76: Hoare triple {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,371 INFO L290 TraceCheckUtils]: 77: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,372 INFO L290 TraceCheckUtils]: 78: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,372 INFO L290 TraceCheckUtils]: 79: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,373 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} #68#return; {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:33,373 INFO L290 TraceCheckUtils]: 81: Hoare triple {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} havoc #t~mem5; {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:33,374 INFO L290 TraceCheckUtils]: 82: Hoare triple {25111#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-15 06:22:33,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-15 06:22:33,378 INFO L272 TraceCheckUtils]: 84: Hoare triple {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,379 INFO L290 TraceCheckUtils]: 85: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,379 INFO L290 TraceCheckUtils]: 86: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,379 INFO L290 TraceCheckUtils]: 87: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,380 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} #68#return; {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-15 06:22:33,380 INFO L290 TraceCheckUtils]: 89: Hoare triple {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} havoc #t~mem5; {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-15 06:22:33,381 INFO L290 TraceCheckUtils]: 90: Hoare triple {25136#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:33,381 INFO L290 TraceCheckUtils]: 91: Hoare triple {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:33,383 INFO L272 TraceCheckUtils]: 92: Hoare triple {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,383 INFO L290 TraceCheckUtils]: 93: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,384 INFO L290 TraceCheckUtils]: 94: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,384 INFO L290 TraceCheckUtils]: 95: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,385 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} #68#return; {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:33,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} havoc #t~mem5; {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:33,386 INFO L290 TraceCheckUtils]: 98: Hoare triple {25161#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:33,386 INFO L290 TraceCheckUtils]: 99: Hoare triple {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:33,390 INFO L272 TraceCheckUtils]: 100: Hoare triple {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,390 INFO L290 TraceCheckUtils]: 101: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,390 INFO L290 TraceCheckUtils]: 103: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,391 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} #68#return; {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:33,391 INFO L290 TraceCheckUtils]: 105: Hoare triple {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} havoc #t~mem5; {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:33,392 INFO L290 TraceCheckUtils]: 106: Hoare triple {25186#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:33,392 INFO L290 TraceCheckUtils]: 107: Hoare triple {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:33,397 INFO L272 TraceCheckUtils]: 108: Hoare triple {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,398 INFO L290 TraceCheckUtils]: 109: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,398 INFO L290 TraceCheckUtils]: 110: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,398 INFO L290 TraceCheckUtils]: 111: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,399 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} #68#return; {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:33,399 INFO L290 TraceCheckUtils]: 113: Hoare triple {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} havoc #t~mem5; {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:33,400 INFO L290 TraceCheckUtils]: 114: Hoare triple {25211#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-15 06:22:33,400 INFO L290 TraceCheckUtils]: 115: Hoare triple {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-15 06:22:33,404 INFO L272 TraceCheckUtils]: 116: Hoare triple {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,404 INFO L290 TraceCheckUtils]: 117: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,405 INFO L290 TraceCheckUtils]: 118: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,405 INFO L290 TraceCheckUtils]: 119: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,405 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} #68#return; {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-15 06:22:33,406 INFO L290 TraceCheckUtils]: 121: Hoare triple {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} havoc #t~mem5; {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-15 06:22:33,407 INFO L290 TraceCheckUtils]: 122: Hoare triple {25236#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-15 06:22:33,407 INFO L290 TraceCheckUtils]: 123: Hoare triple {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-15 06:22:33,409 INFO L272 TraceCheckUtils]: 124: Hoare triple {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,410 INFO L290 TraceCheckUtils]: 125: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,410 INFO L290 TraceCheckUtils]: 126: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,410 INFO L290 TraceCheckUtils]: 127: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 06:22:33,411 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} #68#return; {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-15 06:22:33,411 INFO L290 TraceCheckUtils]: 129: Hoare triple {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} havoc #t~mem5; {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-15 06:22:33,412 INFO L290 TraceCheckUtils]: 130: Hoare triple {25261#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25286#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:33,412 INFO L290 TraceCheckUtils]: 131: Hoare triple {25286#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24860#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:22:33,413 INFO L272 TraceCheckUtils]: 132: Hoare triple {24860#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {25293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:22:33,413 INFO L290 TraceCheckUtils]: 133: Hoare triple {25293#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:22:33,413 INFO L290 TraceCheckUtils]: 134: Hoare triple {25297#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24780#false} is VALID [2022-04-15 06:22:33,414 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-15 06:22:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 276 proven. 205 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 06:22:33,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:22:33,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380789089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:22:33,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:22:33,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 66 [2022-04-15 06:22:33,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:22:33,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866894662] [2022-04-15 06:22:33,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866894662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:22:33,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:22:33,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:22:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847814892] [2022-04-15 06:22:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:22:33,720 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 136 [2022-04-15 06:22:33,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:22:33,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:33,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:33,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:22:33,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:33,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:22:33,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=4106, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 06:22:33,801 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:39,739 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2022-04-15 06:22:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:22:39,739 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 136 [2022-04-15 06:22:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:22:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-15 06:22:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-15 06:22:39,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 117 transitions. [2022-04-15 06:22:39,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:39,860 INFO L225 Difference]: With dead ends: 152 [2022-04-15 06:22:39,861 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 06:22:39,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 112 SyntacticMatches, 24 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3282 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=727, Invalid=9173, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 06:22:39,862 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3192 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:22:39,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 183 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3192 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 06:22:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 06:22:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-04-15 06:22:40,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:22:40,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:22:40,009 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:22:40,010 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:22:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:40,011 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-15 06:22:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-15 06:22:40,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:40,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:40,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-15 06:22:40,012 INFO L87 Difference]: Start difference. First operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-15 06:22:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:40,013 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-15 06:22:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-15 06:22:40,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:40,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:40,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:22:40,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:22:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:22:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-04-15 06:22:40,016 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2022-04-15 06:22:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:22:40,016 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-04-15 06:22:40,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 06:22:40,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 148 transitions. [2022-04-15 06:22:40,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-04-15 06:22:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-15 06:22:40,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:22:40,239 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:22:40,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 06:22:40,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 06:22:40,455 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:22:40,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:22:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 49 times [2022-04-15 06:22:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:40,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1300083945] [2022-04-15 06:22:40,457 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:22:40,457 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:22:40,458 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:22:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 50 times [2022-04-15 06:22:40,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:22:40,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563151758] [2022-04-15 06:22:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:40,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:22:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:22:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {26377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {26291#true} is VALID [2022-04-15 06:22:40,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-15 06:22:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 06:22:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} #68#return; {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-15 06:22:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 06:22:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26316#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 06:22:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26321#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:40,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 06:22:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26326#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 06:22:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26331#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 06:22:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26336#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-15 06:22:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26341#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:40,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-15 06:22:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26346#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 06:22:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26351#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-15 06:22:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26356#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:40,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-15 06:22:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26361#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-15 06:22:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26366#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:40,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-04-15 06:22:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:40,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26371#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:40,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {26291#true} call ULTIMATE.init(); {26377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:22:40,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {26377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {26291#true} is VALID [2022-04-15 06:22:40,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-15 06:22:40,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {26291#true} call #t~ret6 := main(); {26291#true} is VALID [2022-04-15 06:22:40,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {26291#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26291#true} is VALID [2022-04-15 06:22:40,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {26291#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {26296#(= main_~i~0 0)} is VALID [2022-04-15 06:22:40,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {26296#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26296#(= main_~i~0 0)} is VALID [2022-04-15 06:22:40,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {26296#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26297#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:40,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {26297#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26297#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:40,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {26297#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26298#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:40,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {26298#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:40,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {26298#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26299#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:40,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {26299#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:40,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {26299#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26300#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:40,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {26300#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:40,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {26300#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26301#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:40,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {26301#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:40,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {26301#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26302#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:40,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {26302#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:40,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {26302#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26303#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:40,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {26303#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:40,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {26303#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26304#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:40,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {26304#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:40,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {26304#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26305#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:40,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {26305#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:40,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {26305#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26306#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:40,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {26306#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:40,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {26306#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26307#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:40,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {26307#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:40,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {26307#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26308#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:40,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {26308#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:40,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {26308#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26309#(<= main_~i~0 13)} is VALID [2022-04-15 06:22:40,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {26309#(<= main_~i~0 13)} assume !(~i~0 < ~n~0); {26310#(<= main_~n~0 13)} is VALID [2022-04-15 06:22:40,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {26310#(<= main_~n~0 13)} ~i~1 := 0; {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-15 06:22:40,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-15 06:22:40,862 INFO L272 TraceCheckUtils]: 36: Hoare triple {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,862 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26291#true} {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} #68#return; {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-15 06:22:40,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} havoc #t~mem5; {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-15 06:22:40,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {26311#(and (<= main_~n~0 13) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:40,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:40,863 INFO L272 TraceCheckUtils]: 44: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,864 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26291#true} {26316#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:40,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:40,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:40,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:40,865 INFO L272 TraceCheckUtils]: 52: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,865 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {26291#true} {26321#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:40,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:40,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:40,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:40,866 INFO L272 TraceCheckUtils]: 60: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,866 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26291#true} {26326#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:40,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:40,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:40,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:40,867 INFO L272 TraceCheckUtils]: 68: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,867 INFO L290 TraceCheckUtils]: 69: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,867 INFO L290 TraceCheckUtils]: 70: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,867 INFO L290 TraceCheckUtils]: 71: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,868 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26291#true} {26331#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:40,868 INFO L290 TraceCheckUtils]: 73: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:40,868 INFO L290 TraceCheckUtils]: 74: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:40,869 INFO L290 TraceCheckUtils]: 75: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:40,869 INFO L272 TraceCheckUtils]: 76: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,869 INFO L290 TraceCheckUtils]: 77: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,869 INFO L290 TraceCheckUtils]: 78: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,869 INFO L290 TraceCheckUtils]: 79: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,869 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26291#true} {26336#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:40,869 INFO L290 TraceCheckUtils]: 81: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:40,870 INFO L290 TraceCheckUtils]: 82: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:40,870 INFO L290 TraceCheckUtils]: 83: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:40,870 INFO L272 TraceCheckUtils]: 84: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,870 INFO L290 TraceCheckUtils]: 85: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,870 INFO L290 TraceCheckUtils]: 86: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,870 INFO L290 TraceCheckUtils]: 87: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,871 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {26291#true} {26341#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:40,871 INFO L290 TraceCheckUtils]: 89: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:40,871 INFO L290 TraceCheckUtils]: 90: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:40,871 INFO L290 TraceCheckUtils]: 91: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:40,872 INFO L272 TraceCheckUtils]: 92: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,872 INFO L290 TraceCheckUtils]: 93: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,872 INFO L290 TraceCheckUtils]: 94: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,872 INFO L290 TraceCheckUtils]: 95: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,872 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26291#true} {26346#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:40,872 INFO L290 TraceCheckUtils]: 97: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:40,873 INFO L290 TraceCheckUtils]: 98: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:40,873 INFO L290 TraceCheckUtils]: 99: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:40,873 INFO L272 TraceCheckUtils]: 100: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,873 INFO L290 TraceCheckUtils]: 101: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,873 INFO L290 TraceCheckUtils]: 102: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,873 INFO L290 TraceCheckUtils]: 103: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,874 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26291#true} {26351#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:40,874 INFO L290 TraceCheckUtils]: 105: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:40,874 INFO L290 TraceCheckUtils]: 106: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:40,874 INFO L290 TraceCheckUtils]: 107: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:40,874 INFO L272 TraceCheckUtils]: 108: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,875 INFO L290 TraceCheckUtils]: 109: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,875 INFO L290 TraceCheckUtils]: 110: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,875 INFO L290 TraceCheckUtils]: 111: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,875 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {26291#true} {26356#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:40,875 INFO L290 TraceCheckUtils]: 113: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:40,876 INFO L290 TraceCheckUtils]: 114: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:40,876 INFO L290 TraceCheckUtils]: 115: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:40,876 INFO L272 TraceCheckUtils]: 116: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,876 INFO L290 TraceCheckUtils]: 117: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,876 INFO L290 TraceCheckUtils]: 118: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,876 INFO L290 TraceCheckUtils]: 119: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,876 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {26291#true} {26361#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:40,877 INFO L290 TraceCheckUtils]: 121: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:40,877 INFO L290 TraceCheckUtils]: 122: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:40,877 INFO L290 TraceCheckUtils]: 123: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:40,877 INFO L272 TraceCheckUtils]: 124: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,878 INFO L290 TraceCheckUtils]: 125: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,878 INFO L290 TraceCheckUtils]: 126: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,878 INFO L290 TraceCheckUtils]: 127: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,878 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {26291#true} {26366#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:40,878 INFO L290 TraceCheckUtils]: 129: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:40,879 INFO L290 TraceCheckUtils]: 130: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:40,879 INFO L290 TraceCheckUtils]: 131: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:40,879 INFO L272 TraceCheckUtils]: 132: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:40,879 INFO L290 TraceCheckUtils]: 133: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:40,879 INFO L290 TraceCheckUtils]: 134: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:40,879 INFO L290 TraceCheckUtils]: 135: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:40,879 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26291#true} {26371#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:40,880 INFO L290 TraceCheckUtils]: 137: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:40,880 INFO L290 TraceCheckUtils]: 138: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26376#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:22:40,880 INFO L290 TraceCheckUtils]: 139: Hoare triple {26376#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26292#false} is VALID [2022-04-15 06:22:40,880 INFO L272 TraceCheckUtils]: 140: Hoare triple {26292#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#false} is VALID [2022-04-15 06:22:40,880 INFO L290 TraceCheckUtils]: 141: Hoare triple {26292#false} ~cond := #in~cond; {26292#false} is VALID [2022-04-15 06:22:40,881 INFO L290 TraceCheckUtils]: 142: Hoare triple {26292#false} assume 0 == ~cond; {26292#false} is VALID [2022-04-15 06:22:40,881 INFO L290 TraceCheckUtils]: 143: Hoare triple {26292#false} assume !false; {26292#false} is VALID [2022-04-15 06:22:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 315 proven. 218 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 06:22:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:22:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563151758] [2022-04-15 06:22:40,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563151758] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:22:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723182998] [2022-04-15 06:22:40,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:22:40,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:40,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:22:40,882 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:22:40,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 06:22:40,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:22:40,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:22:40,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 06:22:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:41,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:22:41,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {26291#true} call ULTIMATE.init(); {26291#true} is VALID [2022-04-15 06:22:41,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#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(9, 2); {26291#true} is VALID [2022-04-15 06:22:41,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-15 06:22:41,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {26291#true} call #t~ret6 := main(); {26291#true} is VALID [2022-04-15 06:22:41,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {26291#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26291#true} is VALID [2022-04-15 06:22:41,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {26291#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {26399#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:41,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {26399#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26399#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:41,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {26399#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26297#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:41,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {26297#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26297#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:41,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {26297#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26298#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:41,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {26298#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:41,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {26298#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26299#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:41,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {26299#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:41,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {26299#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26300#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:41,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {26300#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:41,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {26300#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26301#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:41,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {26301#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:41,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {26301#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26302#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:41,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {26302#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:41,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {26302#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26303#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:41,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {26303#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:41,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {26303#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26304#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:41,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {26304#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:41,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {26304#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26305#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:41,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {26305#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:41,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {26305#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26306#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:41,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {26306#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:41,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {26306#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26307#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:41,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {26307#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:41,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {26307#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26308#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:41,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {26308#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:41,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {26308#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26309#(<= main_~i~0 13)} is VALID [2022-04-15 06:22:41,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {26309#(<= main_~i~0 13)} assume !(~i~0 < ~n~0); {26310#(<= main_~n~0 13)} is VALID [2022-04-15 06:22:41,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {26310#(<= main_~n~0 13)} ~i~1 := 0; {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-15 06:22:41,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-15 06:22:41,968 INFO L272 TraceCheckUtils]: 36: Hoare triple {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,968 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26291#true} {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} #68#return; {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-15 06:22:41,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} havoc #t~mem5; {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-15 06:22:41,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {26484#(and (<= main_~n~0 13) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,969 INFO L272 TraceCheckUtils]: 44: Hoare triple {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,970 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26291#true} {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} #68#return; {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {26509#(and (<= 1 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:41,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:41,971 INFO L272 TraceCheckUtils]: 52: Hoare triple {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,971 INFO L290 TraceCheckUtils]: 53: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,971 INFO L290 TraceCheckUtils]: 54: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,971 INFO L290 TraceCheckUtils]: 55: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,972 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {26291#true} {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} #68#return; {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:41,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} havoc #t~mem5; {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:41,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {26534#(and (<= main_~n~0 13) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:41,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:41,973 INFO L272 TraceCheckUtils]: 60: Hoare triple {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,973 INFO L290 TraceCheckUtils]: 61: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,973 INFO L290 TraceCheckUtils]: 62: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,973 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26291#true} {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} #68#return; {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:41,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} havoc #t~mem5; {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:41,974 INFO L290 TraceCheckUtils]: 66: Hoare triple {26559#(and (<= main_~n~0 13) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:41,974 INFO L290 TraceCheckUtils]: 67: Hoare triple {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:41,974 INFO L272 TraceCheckUtils]: 68: Hoare triple {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,974 INFO L290 TraceCheckUtils]: 69: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,974 INFO L290 TraceCheckUtils]: 71: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,975 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26291#true} {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} #68#return; {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:41,975 INFO L290 TraceCheckUtils]: 73: Hoare triple {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} havoc #t~mem5; {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:41,976 INFO L290 TraceCheckUtils]: 74: Hoare triple {26584#(and (<= main_~n~0 13) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:41,976 INFO L290 TraceCheckUtils]: 75: Hoare triple {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:41,976 INFO L272 TraceCheckUtils]: 76: Hoare triple {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,976 INFO L290 TraceCheckUtils]: 77: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,976 INFO L290 TraceCheckUtils]: 78: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,976 INFO L290 TraceCheckUtils]: 79: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,977 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26291#true} {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} #68#return; {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:41,977 INFO L290 TraceCheckUtils]: 81: Hoare triple {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} havoc #t~mem5; {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:41,977 INFO L290 TraceCheckUtils]: 82: Hoare triple {26609#(and (<= main_~n~0 13) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,978 INFO L290 TraceCheckUtils]: 83: Hoare triple {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,978 INFO L272 TraceCheckUtils]: 84: Hoare triple {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,978 INFO L290 TraceCheckUtils]: 85: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,978 INFO L290 TraceCheckUtils]: 86: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,978 INFO L290 TraceCheckUtils]: 87: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,978 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {26291#true} {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} #68#return; {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,978 INFO L290 TraceCheckUtils]: 89: Hoare triple {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,979 INFO L290 TraceCheckUtils]: 90: Hoare triple {26634#(and (<= 6 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:41,979 INFO L290 TraceCheckUtils]: 91: Hoare triple {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:41,979 INFO L272 TraceCheckUtils]: 92: Hoare triple {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,979 INFO L290 TraceCheckUtils]: 93: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,979 INFO L290 TraceCheckUtils]: 94: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,979 INFO L290 TraceCheckUtils]: 95: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,980 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26291#true} {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} #68#return; {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:41,980 INFO L290 TraceCheckUtils]: 97: Hoare triple {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} havoc #t~mem5; {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:41,980 INFO L290 TraceCheckUtils]: 98: Hoare triple {26659#(and (<= main_~n~0 13) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:41,981 INFO L290 TraceCheckUtils]: 99: Hoare triple {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:41,981 INFO L272 TraceCheckUtils]: 100: Hoare triple {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,981 INFO L290 TraceCheckUtils]: 101: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,981 INFO L290 TraceCheckUtils]: 102: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,981 INFO L290 TraceCheckUtils]: 103: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,981 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26291#true} {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} #68#return; {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:41,982 INFO L290 TraceCheckUtils]: 105: Hoare triple {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} havoc #t~mem5; {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:41,982 INFO L290 TraceCheckUtils]: 106: Hoare triple {26684#(and (<= main_~n~0 13) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:41,982 INFO L290 TraceCheckUtils]: 107: Hoare triple {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:41,982 INFO L272 TraceCheckUtils]: 108: Hoare triple {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,982 INFO L290 TraceCheckUtils]: 109: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,983 INFO L290 TraceCheckUtils]: 110: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,983 INFO L290 TraceCheckUtils]: 111: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,983 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {26291#true} {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} #68#return; {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:41,983 INFO L290 TraceCheckUtils]: 113: Hoare triple {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} havoc #t~mem5; {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:41,984 INFO L290 TraceCheckUtils]: 114: Hoare triple {26709#(and (<= main_~n~0 13) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,984 INFO L290 TraceCheckUtils]: 115: Hoare triple {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,984 INFO L272 TraceCheckUtils]: 116: Hoare triple {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,984 INFO L290 TraceCheckUtils]: 117: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,984 INFO L290 TraceCheckUtils]: 118: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,984 INFO L290 TraceCheckUtils]: 119: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,985 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {26291#true} {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} #68#return; {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,985 INFO L290 TraceCheckUtils]: 121: Hoare triple {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,985 INFO L290 TraceCheckUtils]: 122: Hoare triple {26734#(and (<= 10 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,986 INFO L290 TraceCheckUtils]: 123: Hoare triple {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,986 INFO L272 TraceCheckUtils]: 124: Hoare triple {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,986 INFO L290 TraceCheckUtils]: 125: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,986 INFO L290 TraceCheckUtils]: 126: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,986 INFO L290 TraceCheckUtils]: 127: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,986 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {26291#true} {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} #68#return; {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,986 INFO L290 TraceCheckUtils]: 129: Hoare triple {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,987 INFO L290 TraceCheckUtils]: 130: Hoare triple {26759#(and (<= 11 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:41,987 INFO L290 TraceCheckUtils]: 131: Hoare triple {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:41,987 INFO L272 TraceCheckUtils]: 132: Hoare triple {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:41,987 INFO L290 TraceCheckUtils]: 133: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:41,987 INFO L290 TraceCheckUtils]: 134: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:41,987 INFO L290 TraceCheckUtils]: 135: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:41,988 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26291#true} {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} #68#return; {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:41,988 INFO L290 TraceCheckUtils]: 137: Hoare triple {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} havoc #t~mem5; {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:41,988 INFO L290 TraceCheckUtils]: 138: Hoare triple {26784#(and (<= main_~n~0 13) (<= 12 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26809#(and (<= 13 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-15 06:22:41,989 INFO L290 TraceCheckUtils]: 139: Hoare triple {26809#(and (<= 13 main_~i~1) (<= main_~n~0 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26292#false} is VALID [2022-04-15 06:22:41,989 INFO L272 TraceCheckUtils]: 140: Hoare triple {26292#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#false} is VALID [2022-04-15 06:22:41,989 INFO L290 TraceCheckUtils]: 141: Hoare triple {26292#false} ~cond := #in~cond; {26292#false} is VALID [2022-04-15 06:22:41,989 INFO L290 TraceCheckUtils]: 142: Hoare triple {26292#false} assume 0 == ~cond; {26292#false} is VALID [2022-04-15 06:22:41,989 INFO L290 TraceCheckUtils]: 143: Hoare triple {26292#false} assume !false; {26292#false} is VALID [2022-04-15 06:22:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 364 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 06:22:41,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:22:42,581 INFO L290 TraceCheckUtils]: 143: Hoare triple {26292#false} assume !false; {26292#false} is VALID [2022-04-15 06:22:42,581 INFO L290 TraceCheckUtils]: 142: Hoare triple {26292#false} assume 0 == ~cond; {26292#false} is VALID [2022-04-15 06:22:42,581 INFO L290 TraceCheckUtils]: 141: Hoare triple {26292#false} ~cond := #in~cond; {26292#false} is VALID [2022-04-15 06:22:42,582 INFO L272 TraceCheckUtils]: 140: Hoare triple {26292#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#false} is VALID [2022-04-15 06:22:42,582 INFO L290 TraceCheckUtils]: 139: Hoare triple {26376#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26292#false} is VALID [2022-04-15 06:22:42,582 INFO L290 TraceCheckUtils]: 138: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26376#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:22:42,583 INFO L290 TraceCheckUtils]: 137: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:42,583 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26291#true} {26371#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:42,583 INFO L290 TraceCheckUtils]: 135: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,583 INFO L290 TraceCheckUtils]: 134: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,583 INFO L290 TraceCheckUtils]: 133: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,583 INFO L272 TraceCheckUtils]: 132: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,583 INFO L290 TraceCheckUtils]: 131: Hoare triple {26371#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:42,584 INFO L290 TraceCheckUtils]: 130: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26371#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:22:42,584 INFO L290 TraceCheckUtils]: 129: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:42,584 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {26291#true} {26366#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:42,585 INFO L290 TraceCheckUtils]: 127: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,585 INFO L290 TraceCheckUtils]: 126: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,585 INFO L290 TraceCheckUtils]: 125: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,585 INFO L272 TraceCheckUtils]: 124: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,585 INFO L290 TraceCheckUtils]: 123: Hoare triple {26366#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:42,585 INFO L290 TraceCheckUtils]: 122: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26366#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:22:42,586 INFO L290 TraceCheckUtils]: 121: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:42,586 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {26291#true} {26361#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:42,586 INFO L290 TraceCheckUtils]: 119: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,586 INFO L290 TraceCheckUtils]: 118: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,586 INFO L290 TraceCheckUtils]: 117: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,586 INFO L272 TraceCheckUtils]: 116: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,586 INFO L290 TraceCheckUtils]: 115: Hoare triple {26361#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:42,587 INFO L290 TraceCheckUtils]: 114: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26361#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:22:42,587 INFO L290 TraceCheckUtils]: 113: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:42,587 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {26291#true} {26356#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:42,588 INFO L290 TraceCheckUtils]: 111: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,588 INFO L290 TraceCheckUtils]: 110: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,588 INFO L290 TraceCheckUtils]: 109: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,588 INFO L272 TraceCheckUtils]: 108: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,588 INFO L290 TraceCheckUtils]: 107: Hoare triple {26356#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:42,588 INFO L290 TraceCheckUtils]: 106: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26356#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:22:42,589 INFO L290 TraceCheckUtils]: 105: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:42,589 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26291#true} {26351#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:42,589 INFO L290 TraceCheckUtils]: 103: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,589 INFO L290 TraceCheckUtils]: 102: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,589 INFO L290 TraceCheckUtils]: 101: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,589 INFO L272 TraceCheckUtils]: 100: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,589 INFO L290 TraceCheckUtils]: 99: Hoare triple {26351#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:42,590 INFO L290 TraceCheckUtils]: 98: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26351#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:22:42,590 INFO L290 TraceCheckUtils]: 97: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:42,590 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26291#true} {26346#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:42,590 INFO L290 TraceCheckUtils]: 95: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,591 INFO L290 TraceCheckUtils]: 94: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,591 INFO L290 TraceCheckUtils]: 93: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,591 INFO L272 TraceCheckUtils]: 92: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,591 INFO L290 TraceCheckUtils]: 91: Hoare triple {26346#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:42,591 INFO L290 TraceCheckUtils]: 90: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26346#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:22:42,592 INFO L290 TraceCheckUtils]: 89: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:42,592 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {26291#true} {26341#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:42,592 INFO L290 TraceCheckUtils]: 87: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,592 INFO L290 TraceCheckUtils]: 86: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,592 INFO L290 TraceCheckUtils]: 85: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,592 INFO L272 TraceCheckUtils]: 84: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,592 INFO L290 TraceCheckUtils]: 83: Hoare triple {26341#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:42,593 INFO L290 TraceCheckUtils]: 82: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26341#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:22:42,593 INFO L290 TraceCheckUtils]: 81: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:42,593 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26291#true} {26336#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:42,593 INFO L290 TraceCheckUtils]: 79: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,593 INFO L290 TraceCheckUtils]: 78: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,594 INFO L290 TraceCheckUtils]: 77: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,594 INFO L272 TraceCheckUtils]: 76: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,594 INFO L290 TraceCheckUtils]: 75: Hoare triple {26336#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:42,594 INFO L290 TraceCheckUtils]: 74: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26336#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:22:42,594 INFO L290 TraceCheckUtils]: 73: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:42,595 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26291#true} {26331#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:42,595 INFO L290 TraceCheckUtils]: 71: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,595 INFO L290 TraceCheckUtils]: 70: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,595 INFO L272 TraceCheckUtils]: 68: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {26331#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:42,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26331#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:22:42,596 INFO L290 TraceCheckUtils]: 65: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:42,602 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26291#true} {26326#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:42,603 INFO L290 TraceCheckUtils]: 63: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,603 INFO L290 TraceCheckUtils]: 62: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,603 INFO L272 TraceCheckUtils]: 60: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {26326#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:42,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26326#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:22:42,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:42,604 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {26291#true} {26321#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:42,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,604 INFO L272 TraceCheckUtils]: 52: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,604 INFO L290 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:42,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26321#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:22:42,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:42,605 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26291#true} {26316#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:42,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,606 INFO L272 TraceCheckUtils]: 44: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {26316#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:42,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {27128#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26316#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:22:42,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {27128#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {27128#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:22:42,607 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26291#true} {27128#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {27128#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:22:42,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-15 06:22:42,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-15 06:22:42,607 INFO L272 TraceCheckUtils]: 36: Hoare triple {27128#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26291#true} is VALID [2022-04-15 06:22:42,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {27128#(<= main_~n~0 (+ main_~i~1 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {27128#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:22:42,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {26310#(<= main_~n~0 13)} ~i~1 := 0; {27128#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:22:42,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {26309#(<= main_~i~0 13)} assume !(~i~0 < ~n~0); {26310#(<= main_~n~0 13)} is VALID [2022-04-15 06:22:42,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {26308#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26309#(<= main_~i~0 13)} is VALID [2022-04-15 06:22:42,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {26308#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:42,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {26307#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26308#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:42,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {26307#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:42,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {26306#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26307#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:42,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {26306#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:42,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {26305#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26306#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:42,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {26305#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:42,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {26304#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26305#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:42,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {26304#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:42,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {26303#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26304#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:42,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {26303#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:42,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {26302#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26303#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:42,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {26302#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:42,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {26301#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26302#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:42,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {26301#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:42,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {26300#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26301#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:42,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {26300#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:42,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {26299#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26300#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:42,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {26299#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:42,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {26298#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26299#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:42,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {26298#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:42,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {26297#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26298#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:42,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {26297#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26297#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:42,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {26399#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26297#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:42,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {26399#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26399#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:42,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {26291#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {26399#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:42,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {26291#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26291#true} is VALID [2022-04-15 06:22:42,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {26291#true} call #t~ret6 := main(); {26291#true} is VALID [2022-04-15 06:22:42,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-15 06:22:42,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-15 06:22:42,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#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(9, 2); {26291#true} is VALID [2022-04-15 06:22:42,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {26291#true} call ULTIMATE.init(); {26291#true} is VALID [2022-04-15 06:22:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 364 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 06:22:42,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723182998] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:22:42,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:22:42,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 48 [2022-04-15 06:22:42,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:22:42,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1300083945] [2022-04-15 06:22:42,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1300083945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:22:42,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:22:42,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:22:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961753201] [2022-04-15 06:22:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:22:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 144 [2022-04-15 06:22:42,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:22:42,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:42,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:42,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:22:42,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:42,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:22:42,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=1754, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:22:42,682 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:44,019 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-04-15 06:22:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:22:44,019 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 144 [2022-04-15 06:22:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:22:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-15 06:22:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-15 06:22:44,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 127 transitions. [2022-04-15 06:22:44,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:44,118 INFO L225 Difference]: With dead ends: 214 [2022-04-15 06:22:44,118 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 06:22:44,119 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1030, Invalid=4822, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 06:22:44,119 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:22:44,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 66 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:22:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 06:22:44,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-15 06:22:44,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:22:44,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:22:44,264 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:22:44,264 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:22:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:44,266 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-15 06:22:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-15 06:22:44,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:44,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:44,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-15 06:22:44,267 INFO L87 Difference]: Start difference. First operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-15 06:22:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:22:44,269 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-15 06:22:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-15 06:22:44,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:22:44,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:22:44,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:22:44,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:22:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:22:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2022-04-15 06:22:44,272 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2022-04-15 06:22:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:22:44,272 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2022-04-15 06:22:44,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:44,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 150 transitions. [2022-04-15 06:22:44,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2022-04-15 06:22:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-15 06:22:44,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:22:44,518 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:22:44,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 06:22:44,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 06:22:44,719 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:22:44,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:22:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 51 times [2022-04-15 06:22:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:44,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558097425] [2022-04-15 06:22:44,721 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:22:44,721 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:22:44,721 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:22:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 52 times [2022-04-15 06:22:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:22:44,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949596712] [2022-04-15 06:22:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:22:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:22:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {28431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {28341#true} is VALID [2022-04-15 06:22:45,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28341#true} {28341#true} #70#return; {28341#true} is VALID [2022-04-15 06:22:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:22:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} #68#return; {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:22:45,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 06:22:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:22:45,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 06:22:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 06:22:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-15 06:22:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:22:45,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-15 06:22:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-15 06:22:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:22:45,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-15 06:22:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:22:45,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-15 06:22:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:22:45,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-15 06:22:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-15 06:22:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:22:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-15 06:22:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:22:45,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-15 06:22:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:22:45,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {28341#true} call ULTIMATE.init(); {28431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:22:45,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {28431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {28341#true} is VALID [2022-04-15 06:22:45,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28341#true} #70#return; {28341#true} is VALID [2022-04-15 06:22:45,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {28341#true} call #t~ret6 := main(); {28341#true} is VALID [2022-04-15 06:22:45,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {28341#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28341#true} is VALID [2022-04-15 06:22:45,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {28341#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {28346#(= main_~i~0 0)} is VALID [2022-04-15 06:22:45,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {28346#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28346#(= main_~i~0 0)} is VALID [2022-04-15 06:22:45,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {28346#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28347#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:22:45,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {28347#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28347#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:22:45,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {28347#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28348#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:22:45,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {28348#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28348#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:22:45,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {28348#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28349#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:22:45,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {28349#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28349#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:22:45,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {28349#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28350#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:22:45,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {28350#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28350#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:22:45,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {28350#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28351#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:22:45,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {28351#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28351#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:22:45,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {28351#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28352#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:22:45,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {28352#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28352#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:22:45,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {28352#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28353#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:22:45,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {28353#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28353#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:22:45,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {28353#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28354#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:22:45,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {28354#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28354#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:22:45,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {28354#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28355#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:22:45,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {28355#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28355#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:22:45,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {28355#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28356#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:22:45,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {28356#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28356#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:22:45,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {28356#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28357#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:22:45,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {28357#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28357#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:22:45,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {28357#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28358#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 06:22:45,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {28358#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28358#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 06:22:45,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {28358#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28359#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 06:22:45,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {28359#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28360#(and (<= main_~i~0 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 13 main_~i~0))} is VALID [2022-04-15 06:22:45,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {28360#(and (<= main_~i~0 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 13 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28361#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} is VALID [2022-04-15 06:22:45,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {28361#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} assume !(~i~0 < ~n~0); {28361#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} is VALID [2022-04-15 06:22:45,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {28361#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} ~i~1 := 0; {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:22:45,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:22:45,365 INFO L272 TraceCheckUtils]: 38: Hoare triple {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,365 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28341#true} {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} #68#return; {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:22:45,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} havoc #t~mem5; {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:22:45,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {28362#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:22:45,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:22:45,366 INFO L272 TraceCheckUtils]: 46: Hoare triple {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,367 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28341#true} {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:22:45,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} havoc #t~mem5; {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:22:45,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {28367#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,368 INFO L272 TraceCheckUtils]: 54: Hoare triple {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,369 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {28341#true} {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {28372#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,370 INFO L272 TraceCheckUtils]: 62: Hoare triple {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,370 INFO L290 TraceCheckUtils]: 64: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,370 INFO L290 TraceCheckUtils]: 65: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,370 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28341#true} {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,371 INFO L290 TraceCheckUtils]: 68: Hoare triple {28377#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:22:45,371 INFO L290 TraceCheckUtils]: 69: Hoare triple {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:22:45,371 INFO L272 TraceCheckUtils]: 70: Hoare triple {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,371 INFO L290 TraceCheckUtils]: 71: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,371 INFO L290 TraceCheckUtils]: 72: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,371 INFO L290 TraceCheckUtils]: 73: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,372 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28341#true} {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:22:45,372 INFO L290 TraceCheckUtils]: 75: Hoare triple {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:22:45,373 INFO L290 TraceCheckUtils]: 76: Hoare triple {28382#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,373 INFO L290 TraceCheckUtils]: 77: Hoare triple {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,373 INFO L272 TraceCheckUtils]: 78: Hoare triple {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,373 INFO L290 TraceCheckUtils]: 79: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,373 INFO L290 TraceCheckUtils]: 80: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,373 INFO L290 TraceCheckUtils]: 81: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,373 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28341#true} {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {28387#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:22:45,375 INFO L290 TraceCheckUtils]: 85: Hoare triple {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:22:45,375 INFO L272 TraceCheckUtils]: 86: Hoare triple {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,375 INFO L290 TraceCheckUtils]: 87: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,375 INFO L290 TraceCheckUtils]: 88: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,375 INFO L290 TraceCheckUtils]: 89: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,375 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {28341#true} {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:22:45,375 INFO L290 TraceCheckUtils]: 91: Hoare triple {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:22:45,376 INFO L290 TraceCheckUtils]: 92: Hoare triple {28392#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:22:45,376 INFO L290 TraceCheckUtils]: 93: Hoare triple {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:22:45,376 INFO L272 TraceCheckUtils]: 94: Hoare triple {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,376 INFO L290 TraceCheckUtils]: 95: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,376 INFO L290 TraceCheckUtils]: 96: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,376 INFO L290 TraceCheckUtils]: 97: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,377 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28341#true} {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:22:45,377 INFO L290 TraceCheckUtils]: 99: Hoare triple {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:22:45,377 INFO L290 TraceCheckUtils]: 100: Hoare triple {28397#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:22:45,378 INFO L290 TraceCheckUtils]: 101: Hoare triple {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:22:45,378 INFO L272 TraceCheckUtils]: 102: Hoare triple {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,378 INFO L290 TraceCheckUtils]: 103: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,378 INFO L290 TraceCheckUtils]: 104: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,378 INFO L290 TraceCheckUtils]: 105: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,378 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {28341#true} {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:22:45,379 INFO L290 TraceCheckUtils]: 107: Hoare triple {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:22:45,379 INFO L290 TraceCheckUtils]: 108: Hoare triple {28402#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,379 INFO L290 TraceCheckUtils]: 109: Hoare triple {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,379 INFO L272 TraceCheckUtils]: 110: Hoare triple {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,380 INFO L290 TraceCheckUtils]: 111: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,380 INFO L290 TraceCheckUtils]: 112: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,380 INFO L290 TraceCheckUtils]: 113: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,380 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28341#true} {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,380 INFO L290 TraceCheckUtils]: 115: Hoare triple {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,381 INFO L290 TraceCheckUtils]: 116: Hoare triple {28407#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:22:45,381 INFO L290 TraceCheckUtils]: 117: Hoare triple {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:22:45,381 INFO L272 TraceCheckUtils]: 118: Hoare triple {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,381 INFO L290 TraceCheckUtils]: 119: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,381 INFO L290 TraceCheckUtils]: 120: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,381 INFO L290 TraceCheckUtils]: 121: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,382 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28341#true} {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:22:45,382 INFO L290 TraceCheckUtils]: 123: Hoare triple {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:22:45,382 INFO L290 TraceCheckUtils]: 124: Hoare triple {28412#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:22:45,383 INFO L290 TraceCheckUtils]: 125: Hoare triple {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:22:45,383 INFO L272 TraceCheckUtils]: 126: Hoare triple {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,383 INFO L290 TraceCheckUtils]: 127: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,383 INFO L290 TraceCheckUtils]: 128: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,383 INFO L290 TraceCheckUtils]: 129: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,383 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {28341#true} {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:22:45,384 INFO L290 TraceCheckUtils]: 131: Hoare triple {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:22:45,384 INFO L290 TraceCheckUtils]: 132: Hoare triple {28417#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:22:45,384 INFO L290 TraceCheckUtils]: 133: Hoare triple {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:22:45,384 INFO L272 TraceCheckUtils]: 134: Hoare triple {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28341#true} is VALID [2022-04-15 06:22:45,385 INFO L290 TraceCheckUtils]: 135: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-15 06:22:45,385 INFO L290 TraceCheckUtils]: 136: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-15 06:22:45,385 INFO L290 TraceCheckUtils]: 137: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:45,385 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {28341#true} {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:22:45,385 INFO L290 TraceCheckUtils]: 139: Hoare triple {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:22:45,386 INFO L290 TraceCheckUtils]: 140: Hoare triple {28422#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28427#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:22:45,386 INFO L290 TraceCheckUtils]: 141: Hoare triple {28427#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28428#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:22:45,386 INFO L272 TraceCheckUtils]: 142: Hoare triple {28428#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28429#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:22:45,387 INFO L290 TraceCheckUtils]: 143: Hoare triple {28429#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28430#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:22:45,387 INFO L290 TraceCheckUtils]: 144: Hoare triple {28430#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28342#false} is VALID [2022-04-15 06:22:45,387 INFO L290 TraceCheckUtils]: 145: Hoare triple {28342#false} assume !false; {28342#false} is VALID [2022-04-15 06:22:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 26 proven. 534 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 06:22:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:22:45,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949596712] [2022-04-15 06:22:45,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949596712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:22:45,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490418030] [2022-04-15 06:22:45,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:22:45,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:45,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:22:45,389 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:22:45,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 06:22:45,744 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:22:45,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:22:45,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 06:22:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:45,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:22:46,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 06:22:56,795 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 06:22:56,796 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 23 treesize of output 10 [2022-04-15 06:22:56,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {28341#true} call ULTIMATE.init(); {28341#true} is VALID [2022-04-15 06:22:56,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#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(9, 2); {28341#true} is VALID [2022-04-15 06:22:56,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-15 06:22:56,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28341#true} #70#return; {28341#true} is VALID [2022-04-15 06:22:56,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {28341#true} call #t~ret6 := main(); {28341#true} is VALID [2022-04-15 06:22:56,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {28341#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28341#true} is VALID [2022-04-15 06:22:56,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {28341#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {28453#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:56,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {28453#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28453#(<= main_~i~0 0)} is VALID [2022-04-15 06:22:56,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {28453#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28460#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:56,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {28460#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28460#(<= main_~i~0 1)} is VALID [2022-04-15 06:22:56,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {28460#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28467#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:56,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {28467#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28467#(<= main_~i~0 2)} is VALID [2022-04-15 06:22:56,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {28467#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28474#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:56,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {28474#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28474#(<= main_~i~0 3)} is VALID [2022-04-15 06:22:56,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {28474#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28481#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:56,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {28481#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28481#(<= main_~i~0 4)} is VALID [2022-04-15 06:22:56,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {28481#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28488#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:56,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {28488#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28488#(<= main_~i~0 5)} is VALID [2022-04-15 06:22:56,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {28488#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28495#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:56,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {28495#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28495#(<= main_~i~0 6)} is VALID [2022-04-15 06:22:56,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {28495#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28502#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:56,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {28502#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28502#(<= main_~i~0 7)} is VALID [2022-04-15 06:22:56,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {28502#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28509#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:56,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {28509#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28509#(<= main_~i~0 8)} is VALID [2022-04-15 06:22:56,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {28509#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28516#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:56,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {28516#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28516#(<= main_~i~0 9)} is VALID [2022-04-15 06:22:56,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {28516#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28523#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:56,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {28523#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28523#(<= main_~i~0 10)} is VALID [2022-04-15 06:22:56,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {28523#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28530#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:56,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {28530#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28530#(<= main_~i~0 11)} is VALID [2022-04-15 06:22:56,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {28530#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28537#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:56,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {28537#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28537#(<= main_~i~0 12)} is VALID [2022-04-15 06:22:56,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {28537#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28544#(<= main_~i~0 13)} is VALID [2022-04-15 06:22:56,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {28544#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28548#(and (<= main_~i~0 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-15 06:22:56,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {28548#(and (<= main_~i~0 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28552#(exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (<= main_~i~0 (+ v_main_~i~0_381 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0)))} is VALID [2022-04-15 06:22:56,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {28552#(exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (<= main_~i~0 (+ v_main_~i~0_381 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0)))} assume !(~i~0 < ~n~0); {28556#(exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1))))} is VALID [2022-04-15 06:22:56,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {28556#(exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1))))} ~i~1 := 0; {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,912 INFO L272 TraceCheckUtils]: 38: Hoare triple {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,914 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,914 INFO L290 TraceCheckUtils]: 43: Hoare triple {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {28560#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,916 INFO L272 TraceCheckUtils]: 46: Hoare triple {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,917 INFO L290 TraceCheckUtils]: 49: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,917 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {28586#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:56,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:56,919 INFO L272 TraceCheckUtils]: 54: Hoare triple {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,920 INFO L290 TraceCheckUtils]: 56: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,920 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} #68#return; {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:56,921 INFO L290 TraceCheckUtils]: 59: Hoare triple {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 06:22:56,921 INFO L290 TraceCheckUtils]: 60: Hoare triple {28611#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:56,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:56,923 INFO L272 TraceCheckUtils]: 62: Hoare triple {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,924 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} #68#return; {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:56,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 06:22:56,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {28636#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:56,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:56,926 INFO L272 TraceCheckUtils]: 70: Hoare triple {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,926 INFO L290 TraceCheckUtils]: 71: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,927 INFO L290 TraceCheckUtils]: 73: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,927 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} #68#return; {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:56,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} havoc #t~mem5; {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 06:22:56,928 INFO L290 TraceCheckUtils]: 76: Hoare triple {28661#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:56,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:56,929 INFO L272 TraceCheckUtils]: 78: Hoare triple {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,930 INFO L290 TraceCheckUtils]: 79: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,930 INFO L290 TraceCheckUtils]: 80: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,930 INFO L290 TraceCheckUtils]: 81: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,931 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} #68#return; {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:56,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} havoc #t~mem5; {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 06:22:56,931 INFO L290 TraceCheckUtils]: 84: Hoare triple {28686#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,932 INFO L290 TraceCheckUtils]: 85: Hoare triple {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,933 INFO L272 TraceCheckUtils]: 86: Hoare triple {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,933 INFO L290 TraceCheckUtils]: 87: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,933 INFO L290 TraceCheckUtils]: 88: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,933 INFO L290 TraceCheckUtils]: 89: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,934 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,934 INFO L290 TraceCheckUtils]: 91: Hoare triple {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,935 INFO L290 TraceCheckUtils]: 92: Hoare triple {28711#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:56,935 INFO L290 TraceCheckUtils]: 93: Hoare triple {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:56,936 INFO L272 TraceCheckUtils]: 94: Hoare triple {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,936 INFO L290 TraceCheckUtils]: 95: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,937 INFO L290 TraceCheckUtils]: 96: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,937 INFO L290 TraceCheckUtils]: 97: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,937 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} #68#return; {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:56,938 INFO L290 TraceCheckUtils]: 99: Hoare triple {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} havoc #t~mem5; {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 06:22:56,938 INFO L290 TraceCheckUtils]: 100: Hoare triple {28736#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:56,939 INFO L290 TraceCheckUtils]: 101: Hoare triple {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:56,939 INFO L272 TraceCheckUtils]: 102: Hoare triple {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,940 INFO L290 TraceCheckUtils]: 103: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,940 INFO L290 TraceCheckUtils]: 104: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,940 INFO L290 TraceCheckUtils]: 105: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,941 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} #68#return; {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:56,941 INFO L290 TraceCheckUtils]: 107: Hoare triple {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} havoc #t~mem5; {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 06:22:56,942 INFO L290 TraceCheckUtils]: 108: Hoare triple {28761#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:56,942 INFO L290 TraceCheckUtils]: 109: Hoare triple {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:56,943 INFO L272 TraceCheckUtils]: 110: Hoare triple {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,943 INFO L290 TraceCheckUtils]: 111: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,943 INFO L290 TraceCheckUtils]: 112: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,944 INFO L290 TraceCheckUtils]: 113: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,944 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} #68#return; {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:56,944 INFO L290 TraceCheckUtils]: 115: Hoare triple {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} havoc #t~mem5; {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 06:22:56,945 INFO L290 TraceCheckUtils]: 116: Hoare triple {28786#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,945 INFO L290 TraceCheckUtils]: 117: Hoare triple {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,946 INFO L272 TraceCheckUtils]: 118: Hoare triple {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,946 INFO L290 TraceCheckUtils]: 119: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,947 INFO L290 TraceCheckUtils]: 120: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,947 INFO L290 TraceCheckUtils]: 121: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,947 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,948 INFO L290 TraceCheckUtils]: 123: Hoare triple {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,948 INFO L290 TraceCheckUtils]: 124: Hoare triple {28811#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28836#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,949 INFO L290 TraceCheckUtils]: 125: Hoare triple {28836#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28836#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,950 INFO L272 TraceCheckUtils]: 126: Hoare triple {28836#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,950 INFO L290 TraceCheckUtils]: 127: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,950 INFO L290 TraceCheckUtils]: 128: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,950 INFO L290 TraceCheckUtils]: 129: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,951 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28836#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #68#return; {28836#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,951 INFO L290 TraceCheckUtils]: 131: Hoare triple {28836#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} havoc #t~mem5; {28836#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,952 INFO L290 TraceCheckUtils]: 132: Hoare triple {28836#(and (<= 11 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28861#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:56,952 INFO L290 TraceCheckUtils]: 133: Hoare triple {28861#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28861#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:56,953 INFO L272 TraceCheckUtils]: 134: Hoare triple {28861#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,953 INFO L290 TraceCheckUtils]: 135: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} ~cond := #in~cond; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,953 INFO L290 TraceCheckUtils]: 136: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume !(0 == ~cond); {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,954 INFO L290 TraceCheckUtils]: 137: Hoare triple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} assume true; {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} is VALID [2022-04-15 06:22:56,954 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {28567#(exists ((v_main_~x~0.base_BEFORE_CALL_98 Int) (v_main_~i~0_381 Int) (v_main_~x~0.offset_BEFORE_CALL_98 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_98) (+ (* 4 v_main_~i~0_381) v_main_~x~0.offset_BEFORE_CALL_98)) 0)))} {28861#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} #68#return; {28861#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:56,955 INFO L290 TraceCheckUtils]: 139: Hoare triple {28861#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} havoc #t~mem5; {28861#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} is VALID [2022-04-15 06:22:56,955 INFO L290 TraceCheckUtils]: 140: Hoare triple {28861#(and (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))) (<= 12 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28886#(and (<= 13 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} is VALID [2022-04-15 06:22:56,956 INFO L290 TraceCheckUtils]: 141: Hoare triple {28886#(and (<= 13 main_~i~1) (exists ((v_main_~i~0_381 Int)) (and (<= v_main_~i~0_381 13) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_381))) 0) (<= main_~n~0 (+ v_main_~i~0_381 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {28428#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:22:56,956 INFO L272 TraceCheckUtils]: 142: Hoare triple {28428#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:22:56,956 INFO L290 TraceCheckUtils]: 143: Hoare triple {28893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:22:56,957 INFO L290 TraceCheckUtils]: 144: Hoare triple {28897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28342#false} is VALID [2022-04-15 06:22:56,957 INFO L290 TraceCheckUtils]: 145: Hoare triple {28342#false} assume !false; {28342#false} is VALID [2022-04-15 06:22:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 325 proven. 235 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 06:22:56,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:22:57,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490418030] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:22:57,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:22:57,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 70 [2022-04-15 06:22:57,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:22:57,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558097425] [2022-04-15 06:22:57,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558097425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:22:57,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:22:57,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 06:22:57,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909027322] [2022-04-15 06:22:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:22:57,276 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 146 [2022-04-15 06:22:57,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:22:57,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:22:57,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:22:57,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 06:22:57,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:22:57,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 06:22:57,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=4623, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 06:22:57,357 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:23:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:03,513 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2022-04-15 06:23:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 06:23:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 146 [2022-04-15 06:23:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:23:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:23:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-15 06:23:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:23:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-15 06:23:03,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 124 transitions. [2022-04-15 06:23:03,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:03,708 INFO L225 Difference]: With dead ends: 162 [2022-04-15 06:23:03,708 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 06:23:03,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 120 SyntacticMatches, 26 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=791, Invalid=10339, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 06:23:03,709 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 95 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3578 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:23:03,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 190 Invalid, 3672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3578 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 06:23:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 06:23:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2022-04-15 06:23:03,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:23:03,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:23:03,858 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:23:03,858 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:23:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:03,859 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-15 06:23:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-15 06:23:03,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:03,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:03,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-15 06:23:03,860 INFO L87 Difference]: Start difference. First operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-15 06:23:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:03,861 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-15 06:23:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-15 06:23:03,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:03,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:03,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:23:03,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:23:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:23:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2022-04-15 06:23:03,863 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 146 [2022-04-15 06:23:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:23:03,864 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2022-04-15 06:23:03,864 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 06:23:03,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 158 transitions. [2022-04-15 06:23:04,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-04-15 06:23:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-15 06:23:04,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:23:04,108 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:23:04,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 06:23:04,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 06:23:04,309 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:23:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:23:04,309 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 53 times [2022-04-15 06:23:04,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:04,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1608428307] [2022-04-15 06:23:04,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:23:04,311 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:23:04,311 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:23:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 54 times [2022-04-15 06:23:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:23:04,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401651131] [2022-04-15 06:23:04,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:23:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:23:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:23:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {30047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {29955#true} is VALID [2022-04-15 06:23:04,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29955#true} {29955#true} #70#return; {29955#true} is VALID [2022-04-15 06:23:04,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 06:23:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} #68#return; {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:04,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 06:23:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29981#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {29981#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:23:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 06:23:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29986#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {29986#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:23:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 06:23:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29991#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {29991#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:23:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-15 06:23:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29996#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {29996#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:23:04,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-15 06:23:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {30001#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {30001#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:23:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-15 06:23:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {30006#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {30006#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:23:04,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-15 06:23:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {30011#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {30011#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:23:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-15 06:23:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {30016#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {30016#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:23:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-15 06:23:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {30021#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {30021#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:23:04,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-15 06:23:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {30026#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {30026#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:23:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-15 06:23:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {30031#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {30031#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:23:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-15 06:23:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {30036#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {30036#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:23:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-04-15 06:23:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:04,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {30041#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {30041#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:23:04,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {29955#true} call ULTIMATE.init(); {30047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:23:04,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {30047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {29955#true} is VALID [2022-04-15 06:23:04,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29955#true} #70#return; {29955#true} is VALID [2022-04-15 06:23:04,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {29955#true} call #t~ret6 := main(); {29955#true} is VALID [2022-04-15 06:23:04,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {29955#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29955#true} is VALID [2022-04-15 06:23:04,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {29955#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {29960#(= main_~i~0 0)} is VALID [2022-04-15 06:23:04,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {29960#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29960#(= main_~i~0 0)} is VALID [2022-04-15 06:23:04,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {29960#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29961#(<= main_~i~0 1)} is VALID [2022-04-15 06:23:04,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {29961#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29961#(<= main_~i~0 1)} is VALID [2022-04-15 06:23:04,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {29961#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29962#(<= main_~i~0 2)} is VALID [2022-04-15 06:23:04,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {29962#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29962#(<= main_~i~0 2)} is VALID [2022-04-15 06:23:04,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {29962#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29963#(<= main_~i~0 3)} is VALID [2022-04-15 06:23:04,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {29963#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29963#(<= main_~i~0 3)} is VALID [2022-04-15 06:23:04,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {29963#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29964#(<= main_~i~0 4)} is VALID [2022-04-15 06:23:04,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {29964#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29964#(<= main_~i~0 4)} is VALID [2022-04-15 06:23:04,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {29964#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29965#(<= main_~i~0 5)} is VALID [2022-04-15 06:23:04,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {29965#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29965#(<= main_~i~0 5)} is VALID [2022-04-15 06:23:04,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {29965#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29966#(<= main_~i~0 6)} is VALID [2022-04-15 06:23:04,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {29966#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29966#(<= main_~i~0 6)} is VALID [2022-04-15 06:23:04,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {29966#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29967#(<= main_~i~0 7)} is VALID [2022-04-15 06:23:04,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {29967#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29967#(<= main_~i~0 7)} is VALID [2022-04-15 06:23:04,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {29967#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29968#(<= main_~i~0 8)} is VALID [2022-04-15 06:23:04,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {29968#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29968#(<= main_~i~0 8)} is VALID [2022-04-15 06:23:04,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {29968#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29969#(<= main_~i~0 9)} is VALID [2022-04-15 06:23:04,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {29969#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29969#(<= main_~i~0 9)} is VALID [2022-04-15 06:23:04,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {29969#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29970#(<= main_~i~0 10)} is VALID [2022-04-15 06:23:04,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {29970#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29970#(<= main_~i~0 10)} is VALID [2022-04-15 06:23:04,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {29970#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29971#(<= main_~i~0 11)} is VALID [2022-04-15 06:23:04,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {29971#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29971#(<= main_~i~0 11)} is VALID [2022-04-15 06:23:04,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {29971#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29972#(<= main_~i~0 12)} is VALID [2022-04-15 06:23:04,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {29972#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29972#(<= main_~i~0 12)} is VALID [2022-04-15 06:23:04,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {29972#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29973#(<= main_~i~0 13)} is VALID [2022-04-15 06:23:04,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {29973#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29973#(<= main_~i~0 13)} is VALID [2022-04-15 06:23:04,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {29973#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29974#(<= main_~i~0 14)} is VALID [2022-04-15 06:23:04,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {29974#(<= main_~i~0 14)} assume !(~i~0 < ~n~0); {29975#(<= main_~n~0 14)} is VALID [2022-04-15 06:23:04,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {29975#(<= main_~n~0 14)} ~i~1 := 0; {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:04,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:04,740 INFO L272 TraceCheckUtils]: 38: Hoare triple {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,740 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29955#true} {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} #68#return; {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:04,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} havoc #t~mem5; {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:04,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {29976#(and (= main_~i~1 0) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29981#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:23:04,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {29981#(<= main_~n~0 (+ main_~i~1 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29981#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:23:04,741 INFO L272 TraceCheckUtils]: 46: Hoare triple {29981#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,742 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29955#true} {29981#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {29981#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:23:04,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {29981#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {29981#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:23:04,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {29981#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29986#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:23:04,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {29986#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29986#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:23:04,743 INFO L272 TraceCheckUtils]: 54: Hoare triple {29986#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,744 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29955#true} {29986#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {29986#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:23:04,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {29986#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {29986#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:23:04,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {29986#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29991#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:23:04,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {29991#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29991#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:23:04,745 INFO L272 TraceCheckUtils]: 62: Hoare triple {29991#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,745 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29955#true} {29991#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {29991#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:23:04,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {29991#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {29991#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:23:04,746 INFO L290 TraceCheckUtils]: 68: Hoare triple {29991#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29996#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:23:04,746 INFO L290 TraceCheckUtils]: 69: Hoare triple {29996#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29996#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:23:04,746 INFO L272 TraceCheckUtils]: 70: Hoare triple {29996#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,746 INFO L290 TraceCheckUtils]: 71: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,746 INFO L290 TraceCheckUtils]: 72: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,746 INFO L290 TraceCheckUtils]: 73: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,747 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29955#true} {29996#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {29996#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:23:04,747 INFO L290 TraceCheckUtils]: 75: Hoare triple {29996#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {29996#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:23:04,747 INFO L290 TraceCheckUtils]: 76: Hoare triple {29996#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30001#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:23:04,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {30001#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30001#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:23:04,748 INFO L272 TraceCheckUtils]: 78: Hoare triple {30001#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,748 INFO L290 TraceCheckUtils]: 79: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,748 INFO L290 TraceCheckUtils]: 80: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,748 INFO L290 TraceCheckUtils]: 81: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,748 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29955#true} {30001#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {30001#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:23:04,749 INFO L290 TraceCheckUtils]: 83: Hoare triple {30001#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {30001#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:23:04,749 INFO L290 TraceCheckUtils]: 84: Hoare triple {30001#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30006#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:23:04,749 INFO L290 TraceCheckUtils]: 85: Hoare triple {30006#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30006#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:23:04,749 INFO L272 TraceCheckUtils]: 86: Hoare triple {30006#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,750 INFO L290 TraceCheckUtils]: 87: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,750 INFO L290 TraceCheckUtils]: 88: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,750 INFO L290 TraceCheckUtils]: 89: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,750 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29955#true} {30006#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {30006#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:23:04,750 INFO L290 TraceCheckUtils]: 91: Hoare triple {30006#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {30006#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:23:04,751 INFO L290 TraceCheckUtils]: 92: Hoare triple {30006#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30011#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:23:04,751 INFO L290 TraceCheckUtils]: 93: Hoare triple {30011#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30011#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:23:04,751 INFO L272 TraceCheckUtils]: 94: Hoare triple {30011#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,751 INFO L290 TraceCheckUtils]: 95: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,751 INFO L290 TraceCheckUtils]: 96: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,751 INFO L290 TraceCheckUtils]: 97: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,752 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29955#true} {30011#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {30011#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:23:04,752 INFO L290 TraceCheckUtils]: 99: Hoare triple {30011#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {30011#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:23:04,752 INFO L290 TraceCheckUtils]: 100: Hoare triple {30011#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30016#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:23:04,753 INFO L290 TraceCheckUtils]: 101: Hoare triple {30016#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30016#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:23:04,753 INFO L272 TraceCheckUtils]: 102: Hoare triple {30016#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,753 INFO L290 TraceCheckUtils]: 103: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,753 INFO L290 TraceCheckUtils]: 104: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,753 INFO L290 TraceCheckUtils]: 105: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,753 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29955#true} {30016#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {30016#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:23:04,754 INFO L290 TraceCheckUtils]: 107: Hoare triple {30016#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {30016#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:23:04,754 INFO L290 TraceCheckUtils]: 108: Hoare triple {30016#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30021#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:23:04,754 INFO L290 TraceCheckUtils]: 109: Hoare triple {30021#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30021#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:23:04,754 INFO L272 TraceCheckUtils]: 110: Hoare triple {30021#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,754 INFO L290 TraceCheckUtils]: 111: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,754 INFO L290 TraceCheckUtils]: 112: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,754 INFO L290 TraceCheckUtils]: 113: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,755 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29955#true} {30021#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {30021#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:23:04,755 INFO L290 TraceCheckUtils]: 115: Hoare triple {30021#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {30021#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:23:04,756 INFO L290 TraceCheckUtils]: 116: Hoare triple {30021#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30026#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:23:04,756 INFO L290 TraceCheckUtils]: 117: Hoare triple {30026#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30026#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:23:04,756 INFO L272 TraceCheckUtils]: 118: Hoare triple {30026#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,756 INFO L290 TraceCheckUtils]: 119: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,756 INFO L290 TraceCheckUtils]: 120: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,756 INFO L290 TraceCheckUtils]: 121: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,756 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29955#true} {30026#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {30026#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:23:04,757 INFO L290 TraceCheckUtils]: 123: Hoare triple {30026#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {30026#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:23:04,757 INFO L290 TraceCheckUtils]: 124: Hoare triple {30026#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30031#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:23:04,757 INFO L290 TraceCheckUtils]: 125: Hoare triple {30031#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30031#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:23:04,758 INFO L272 TraceCheckUtils]: 126: Hoare triple {30031#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,758 INFO L290 TraceCheckUtils]: 127: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,758 INFO L290 TraceCheckUtils]: 128: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,758 INFO L290 TraceCheckUtils]: 129: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,758 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29955#true} {30031#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {30031#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:23:04,758 INFO L290 TraceCheckUtils]: 131: Hoare triple {30031#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {30031#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:23:04,759 INFO L290 TraceCheckUtils]: 132: Hoare triple {30031#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30036#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:23:04,759 INFO L290 TraceCheckUtils]: 133: Hoare triple {30036#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30036#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:23:04,759 INFO L272 TraceCheckUtils]: 134: Hoare triple {30036#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,759 INFO L290 TraceCheckUtils]: 135: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,759 INFO L290 TraceCheckUtils]: 136: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,759 INFO L290 TraceCheckUtils]: 137: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,760 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29955#true} {30036#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {30036#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:23:04,760 INFO L290 TraceCheckUtils]: 139: Hoare triple {30036#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {30036#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:23:04,761 INFO L290 TraceCheckUtils]: 140: Hoare triple {30036#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30041#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:23:04,761 INFO L290 TraceCheckUtils]: 141: Hoare triple {30041#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30041#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:23:04,761 INFO L272 TraceCheckUtils]: 142: Hoare triple {30041#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:04,761 INFO L290 TraceCheckUtils]: 143: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:04,761 INFO L290 TraceCheckUtils]: 144: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:04,761 INFO L290 TraceCheckUtils]: 145: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:04,762 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {29955#true} {30041#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {30041#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:23:04,762 INFO L290 TraceCheckUtils]: 147: Hoare triple {30041#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {30041#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:23:04,763 INFO L290 TraceCheckUtils]: 148: Hoare triple {30041#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30046#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:23:04,763 INFO L290 TraceCheckUtils]: 149: Hoare triple {30046#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29956#false} is VALID [2022-04-15 06:23:04,763 INFO L272 TraceCheckUtils]: 150: Hoare triple {29956#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#false} is VALID [2022-04-15 06:23:04,763 INFO L290 TraceCheckUtils]: 151: Hoare triple {29956#false} ~cond := #in~cond; {29956#false} is VALID [2022-04-15 06:23:04,763 INFO L290 TraceCheckUtils]: 152: Hoare triple {29956#false} assume 0 == ~cond; {29956#false} is VALID [2022-04-15 06:23:04,763 INFO L290 TraceCheckUtils]: 153: Hoare triple {29956#false} assume !false; {29956#false} is VALID [2022-04-15 06:23:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 367 proven. 249 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 06:23:04,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:23:04,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401651131] [2022-04-15 06:23:04,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401651131] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:23:04,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271665947] [2022-04-15 06:23:04,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:23:04,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:23:04,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:23:04,765 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:23:04,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 06:23:05,069 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-15 06:23:05,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:23:05,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:23:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:05,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:23:06,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {29955#true} call ULTIMATE.init(); {29955#true} is VALID [2022-04-15 06:23:06,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#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(9, 2); {29955#true} is VALID [2022-04-15 06:23:06,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29955#true} #70#return; {29955#true} is VALID [2022-04-15 06:23:06,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {29955#true} call #t~ret6 := main(); {29955#true} is VALID [2022-04-15 06:23:06,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {29955#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29955#true} is VALID [2022-04-15 06:23:06,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {29955#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {30069#(<= main_~i~0 0)} is VALID [2022-04-15 06:23:06,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {30069#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {30069#(<= main_~i~0 0)} is VALID [2022-04-15 06:23:06,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {30069#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29961#(<= main_~i~0 1)} is VALID [2022-04-15 06:23:06,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {29961#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29961#(<= main_~i~0 1)} is VALID [2022-04-15 06:23:06,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {29961#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29962#(<= main_~i~0 2)} is VALID [2022-04-15 06:23:06,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {29962#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29962#(<= main_~i~0 2)} is VALID [2022-04-15 06:23:06,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {29962#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29963#(<= main_~i~0 3)} is VALID [2022-04-15 06:23:06,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {29963#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29963#(<= main_~i~0 3)} is VALID [2022-04-15 06:23:06,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {29963#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29964#(<= main_~i~0 4)} is VALID [2022-04-15 06:23:06,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {29964#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29964#(<= main_~i~0 4)} is VALID [2022-04-15 06:23:06,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {29964#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29965#(<= main_~i~0 5)} is VALID [2022-04-15 06:23:06,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {29965#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29965#(<= main_~i~0 5)} is VALID [2022-04-15 06:23:06,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {29965#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29966#(<= main_~i~0 6)} is VALID [2022-04-15 06:23:06,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {29966#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29966#(<= main_~i~0 6)} is VALID [2022-04-15 06:23:06,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {29966#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29967#(<= main_~i~0 7)} is VALID [2022-04-15 06:23:06,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {29967#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29967#(<= main_~i~0 7)} is VALID [2022-04-15 06:23:06,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {29967#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29968#(<= main_~i~0 8)} is VALID [2022-04-15 06:23:06,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {29968#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29968#(<= main_~i~0 8)} is VALID [2022-04-15 06:23:06,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {29968#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29969#(<= main_~i~0 9)} is VALID [2022-04-15 06:23:06,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {29969#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29969#(<= main_~i~0 9)} is VALID [2022-04-15 06:23:06,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {29969#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29970#(<= main_~i~0 10)} is VALID [2022-04-15 06:23:06,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {29970#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29970#(<= main_~i~0 10)} is VALID [2022-04-15 06:23:06,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {29970#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29971#(<= main_~i~0 11)} is VALID [2022-04-15 06:23:06,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {29971#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29971#(<= main_~i~0 11)} is VALID [2022-04-15 06:23:06,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {29971#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29972#(<= main_~i~0 12)} is VALID [2022-04-15 06:23:06,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {29972#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29972#(<= main_~i~0 12)} is VALID [2022-04-15 06:23:06,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {29972#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29973#(<= main_~i~0 13)} is VALID [2022-04-15 06:23:06,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {29973#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29973#(<= main_~i~0 13)} is VALID [2022-04-15 06:23:06,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {29973#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29974#(<= main_~i~0 14)} is VALID [2022-04-15 06:23:06,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {29974#(<= main_~i~0 14)} assume !(~i~0 < ~n~0); {29975#(<= main_~n~0 14)} is VALID [2022-04-15 06:23:06,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {29975#(<= main_~n~0 14)} ~i~1 := 0; {30160#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {30160#(and (<= 0 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30160#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,210 INFO L272 TraceCheckUtils]: 38: Hoare triple {30160#(and (<= 0 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,210 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29955#true} {30160#(and (<= 0 main_~i~1) (<= main_~n~0 14))} #68#return; {30160#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {30160#(and (<= 0 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30160#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {30160#(and (<= 0 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30185#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {30185#(and (<= 1 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30185#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,211 INFO L272 TraceCheckUtils]: 46: Hoare triple {30185#(and (<= 1 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,213 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29955#true} {30185#(and (<= 1 main_~i~1) (<= main_~n~0 14))} #68#return; {30185#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {30185#(and (<= 1 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30185#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {30185#(and (<= 1 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30210#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {30210#(and (<= 2 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30210#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,214 INFO L272 TraceCheckUtils]: 54: Hoare triple {30210#(and (<= 2 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,214 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29955#true} {30210#(and (<= 2 main_~i~1) (<= main_~n~0 14))} #68#return; {30210#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,214 INFO L290 TraceCheckUtils]: 59: Hoare triple {30210#(and (<= 2 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30210#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {30210#(and (<= 2 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30235#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {30235#(and (<= 3 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30235#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,215 INFO L272 TraceCheckUtils]: 62: Hoare triple {30235#(and (<= 3 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,215 INFO L290 TraceCheckUtils]: 64: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,216 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29955#true} {30235#(and (<= 3 main_~i~1) (<= main_~n~0 14))} #68#return; {30235#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {30235#(and (<= 3 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30235#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {30235#(and (<= 3 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30260#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {30260#(and (<= 4 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30260#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,217 INFO L272 TraceCheckUtils]: 70: Hoare triple {30260#(and (<= 4 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,217 INFO L290 TraceCheckUtils]: 72: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,217 INFO L290 TraceCheckUtils]: 73: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,217 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29955#true} {30260#(and (<= 4 main_~i~1) (<= main_~n~0 14))} #68#return; {30260#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,218 INFO L290 TraceCheckUtils]: 75: Hoare triple {30260#(and (<= 4 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30260#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,218 INFO L290 TraceCheckUtils]: 76: Hoare triple {30260#(and (<= 4 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30285#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,218 INFO L290 TraceCheckUtils]: 77: Hoare triple {30285#(and (<= 5 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30285#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,218 INFO L272 TraceCheckUtils]: 78: Hoare triple {30285#(and (<= 5 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,218 INFO L290 TraceCheckUtils]: 79: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,219 INFO L290 TraceCheckUtils]: 80: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,219 INFO L290 TraceCheckUtils]: 81: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,219 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29955#true} {30285#(and (<= 5 main_~i~1) (<= main_~n~0 14))} #68#return; {30285#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,219 INFO L290 TraceCheckUtils]: 83: Hoare triple {30285#(and (<= 5 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30285#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,220 INFO L290 TraceCheckUtils]: 84: Hoare triple {30285#(and (<= 5 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30310#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,220 INFO L290 TraceCheckUtils]: 85: Hoare triple {30310#(and (<= 6 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30310#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,220 INFO L272 TraceCheckUtils]: 86: Hoare triple {30310#(and (<= 6 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,220 INFO L290 TraceCheckUtils]: 87: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,220 INFO L290 TraceCheckUtils]: 88: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,220 INFO L290 TraceCheckUtils]: 89: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,221 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29955#true} {30310#(and (<= 6 main_~i~1) (<= main_~n~0 14))} #68#return; {30310#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,221 INFO L290 TraceCheckUtils]: 91: Hoare triple {30310#(and (<= 6 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30310#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,221 INFO L290 TraceCheckUtils]: 92: Hoare triple {30310#(and (<= 6 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30335#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,222 INFO L290 TraceCheckUtils]: 93: Hoare triple {30335#(and (<= 7 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30335#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,222 INFO L272 TraceCheckUtils]: 94: Hoare triple {30335#(and (<= 7 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,222 INFO L290 TraceCheckUtils]: 95: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,222 INFO L290 TraceCheckUtils]: 96: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,222 INFO L290 TraceCheckUtils]: 97: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,222 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29955#true} {30335#(and (<= 7 main_~i~1) (<= main_~n~0 14))} #68#return; {30335#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,222 INFO L290 TraceCheckUtils]: 99: Hoare triple {30335#(and (<= 7 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30335#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,223 INFO L290 TraceCheckUtils]: 100: Hoare triple {30335#(and (<= 7 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30360#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,223 INFO L290 TraceCheckUtils]: 101: Hoare triple {30360#(and (<= 8 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30360#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,223 INFO L272 TraceCheckUtils]: 102: Hoare triple {30360#(and (<= 8 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,223 INFO L290 TraceCheckUtils]: 103: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,223 INFO L290 TraceCheckUtils]: 104: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,223 INFO L290 TraceCheckUtils]: 105: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,224 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29955#true} {30360#(and (<= 8 main_~i~1) (<= main_~n~0 14))} #68#return; {30360#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,224 INFO L290 TraceCheckUtils]: 107: Hoare triple {30360#(and (<= 8 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30360#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,224 INFO L290 TraceCheckUtils]: 108: Hoare triple {30360#(and (<= 8 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30385#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,225 INFO L290 TraceCheckUtils]: 109: Hoare triple {30385#(and (<= 9 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30385#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,225 INFO L272 TraceCheckUtils]: 110: Hoare triple {30385#(and (<= 9 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,225 INFO L290 TraceCheckUtils]: 111: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,225 INFO L290 TraceCheckUtils]: 112: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,225 INFO L290 TraceCheckUtils]: 113: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,225 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29955#true} {30385#(and (<= 9 main_~i~1) (<= main_~n~0 14))} #68#return; {30385#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,226 INFO L290 TraceCheckUtils]: 115: Hoare triple {30385#(and (<= 9 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30385#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,226 INFO L290 TraceCheckUtils]: 116: Hoare triple {30385#(and (<= 9 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30410#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,226 INFO L290 TraceCheckUtils]: 117: Hoare triple {30410#(and (<= 10 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30410#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,226 INFO L272 TraceCheckUtils]: 118: Hoare triple {30410#(and (<= 10 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,226 INFO L290 TraceCheckUtils]: 119: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,226 INFO L290 TraceCheckUtils]: 120: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,227 INFO L290 TraceCheckUtils]: 121: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,227 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29955#true} {30410#(and (<= 10 main_~i~1) (<= main_~n~0 14))} #68#return; {30410#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,227 INFO L290 TraceCheckUtils]: 123: Hoare triple {30410#(and (<= 10 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30410#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,228 INFO L290 TraceCheckUtils]: 124: Hoare triple {30410#(and (<= 10 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30435#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,228 INFO L290 TraceCheckUtils]: 125: Hoare triple {30435#(and (<= 11 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30435#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,228 INFO L272 TraceCheckUtils]: 126: Hoare triple {30435#(and (<= 11 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,228 INFO L290 TraceCheckUtils]: 127: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,228 INFO L290 TraceCheckUtils]: 128: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,228 INFO L290 TraceCheckUtils]: 129: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,228 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29955#true} {30435#(and (<= 11 main_~i~1) (<= main_~n~0 14))} #68#return; {30435#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,229 INFO L290 TraceCheckUtils]: 131: Hoare triple {30435#(and (<= 11 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30435#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,229 INFO L290 TraceCheckUtils]: 132: Hoare triple {30435#(and (<= 11 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30460#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,229 INFO L290 TraceCheckUtils]: 133: Hoare triple {30460#(and (<= 12 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30460#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,230 INFO L272 TraceCheckUtils]: 134: Hoare triple {30460#(and (<= 12 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,230 INFO L290 TraceCheckUtils]: 135: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,230 INFO L290 TraceCheckUtils]: 136: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,230 INFO L290 TraceCheckUtils]: 137: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,230 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29955#true} {30460#(and (<= 12 main_~i~1) (<= main_~n~0 14))} #68#return; {30460#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,230 INFO L290 TraceCheckUtils]: 139: Hoare triple {30460#(and (<= 12 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30460#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,231 INFO L290 TraceCheckUtils]: 140: Hoare triple {30460#(and (<= 12 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30485#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,231 INFO L290 TraceCheckUtils]: 141: Hoare triple {30485#(and (<= 13 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30485#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,231 INFO L272 TraceCheckUtils]: 142: Hoare triple {30485#(and (<= 13 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,231 INFO L290 TraceCheckUtils]: 143: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,231 INFO L290 TraceCheckUtils]: 144: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,231 INFO L290 TraceCheckUtils]: 145: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,232 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {29955#true} {30485#(and (<= 13 main_~i~1) (<= main_~n~0 14))} #68#return; {30485#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,232 INFO L290 TraceCheckUtils]: 147: Hoare triple {30485#(and (<= 13 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30485#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,232 INFO L290 TraceCheckUtils]: 148: Hoare triple {30485#(and (<= 13 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30510#(and (<= 14 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-15 06:23:06,233 INFO L290 TraceCheckUtils]: 149: Hoare triple {30510#(and (<= 14 main_~i~1) (<= main_~n~0 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29956#false} is VALID [2022-04-15 06:23:06,233 INFO L272 TraceCheckUtils]: 150: Hoare triple {29956#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#false} is VALID [2022-04-15 06:23:06,233 INFO L290 TraceCheckUtils]: 151: Hoare triple {29956#false} ~cond := #in~cond; {29956#false} is VALID [2022-04-15 06:23:06,233 INFO L290 TraceCheckUtils]: 152: Hoare triple {29956#false} assume 0 == ~cond; {29956#false} is VALID [2022-04-15 06:23:06,233 INFO L290 TraceCheckUtils]: 153: Hoare triple {29956#false} assume !false; {29956#false} is VALID [2022-04-15 06:23:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 420 proven. 196 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 06:23:06,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:23:06,863 INFO L290 TraceCheckUtils]: 153: Hoare triple {29956#false} assume !false; {29956#false} is VALID [2022-04-15 06:23:06,863 INFO L290 TraceCheckUtils]: 152: Hoare triple {29956#false} assume 0 == ~cond; {29956#false} is VALID [2022-04-15 06:23:06,863 INFO L290 TraceCheckUtils]: 151: Hoare triple {29956#false} ~cond := #in~cond; {29956#false} is VALID [2022-04-15 06:23:06,863 INFO L272 TraceCheckUtils]: 150: Hoare triple {29956#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#false} is VALID [2022-04-15 06:23:06,864 INFO L290 TraceCheckUtils]: 149: Hoare triple {30046#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29956#false} is VALID [2022-04-15 06:23:06,864 INFO L290 TraceCheckUtils]: 148: Hoare triple {30041#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30046#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 06:23:06,864 INFO L290 TraceCheckUtils]: 147: Hoare triple {30041#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {30041#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:23:06,865 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {29955#true} {30041#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {30041#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:23:06,865 INFO L290 TraceCheckUtils]: 145: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,865 INFO L290 TraceCheckUtils]: 144: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,865 INFO L290 TraceCheckUtils]: 143: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,865 INFO L272 TraceCheckUtils]: 142: Hoare triple {30041#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,865 INFO L290 TraceCheckUtils]: 141: Hoare triple {30041#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30041#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:23:06,866 INFO L290 TraceCheckUtils]: 140: Hoare triple {30036#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30041#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 06:23:06,866 INFO L290 TraceCheckUtils]: 139: Hoare triple {30036#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {30036#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:23:06,866 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29955#true} {30036#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {30036#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:23:06,866 INFO L290 TraceCheckUtils]: 137: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,866 INFO L290 TraceCheckUtils]: 136: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,867 INFO L290 TraceCheckUtils]: 135: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,867 INFO L272 TraceCheckUtils]: 134: Hoare triple {30036#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,867 INFO L290 TraceCheckUtils]: 133: Hoare triple {30036#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30036#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:23:06,867 INFO L290 TraceCheckUtils]: 132: Hoare triple {30031#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30036#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 06:23:06,867 INFO L290 TraceCheckUtils]: 131: Hoare triple {30031#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {30031#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:23:06,868 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29955#true} {30031#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {30031#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:23:06,868 INFO L290 TraceCheckUtils]: 129: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,868 INFO L290 TraceCheckUtils]: 128: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,868 INFO L290 TraceCheckUtils]: 127: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,868 INFO L272 TraceCheckUtils]: 126: Hoare triple {30031#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,868 INFO L290 TraceCheckUtils]: 125: Hoare triple {30031#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30031#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:23:06,869 INFO L290 TraceCheckUtils]: 124: Hoare triple {30026#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30031#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 06:23:06,869 INFO L290 TraceCheckUtils]: 123: Hoare triple {30026#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {30026#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:23:06,869 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29955#true} {30026#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {30026#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:23:06,869 INFO L290 TraceCheckUtils]: 121: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,870 INFO L290 TraceCheckUtils]: 120: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,870 INFO L290 TraceCheckUtils]: 119: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,870 INFO L272 TraceCheckUtils]: 118: Hoare triple {30026#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,870 INFO L290 TraceCheckUtils]: 117: Hoare triple {30026#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30026#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:23:06,870 INFO L290 TraceCheckUtils]: 116: Hoare triple {30021#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30026#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 06:23:06,870 INFO L290 TraceCheckUtils]: 115: Hoare triple {30021#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {30021#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:23:06,871 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29955#true} {30021#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {30021#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:23:06,871 INFO L290 TraceCheckUtils]: 113: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,871 INFO L290 TraceCheckUtils]: 112: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,871 INFO L290 TraceCheckUtils]: 111: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,871 INFO L272 TraceCheckUtils]: 110: Hoare triple {30021#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,871 INFO L290 TraceCheckUtils]: 109: Hoare triple {30021#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30021#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:23:06,872 INFO L290 TraceCheckUtils]: 108: Hoare triple {30016#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30021#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 06:23:06,872 INFO L290 TraceCheckUtils]: 107: Hoare triple {30016#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {30016#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:23:06,872 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29955#true} {30016#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {30016#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:23:06,872 INFO L290 TraceCheckUtils]: 105: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,872 INFO L290 TraceCheckUtils]: 104: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,872 INFO L290 TraceCheckUtils]: 103: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,873 INFO L272 TraceCheckUtils]: 102: Hoare triple {30016#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,873 INFO L290 TraceCheckUtils]: 101: Hoare triple {30016#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30016#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:23:06,873 INFO L290 TraceCheckUtils]: 100: Hoare triple {30011#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30016#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 06:23:06,873 INFO L290 TraceCheckUtils]: 99: Hoare triple {30011#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {30011#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:23:06,874 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29955#true} {30011#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {30011#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:23:06,874 INFO L290 TraceCheckUtils]: 97: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,874 INFO L290 TraceCheckUtils]: 96: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,874 INFO L290 TraceCheckUtils]: 95: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,874 INFO L272 TraceCheckUtils]: 94: Hoare triple {30011#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,874 INFO L290 TraceCheckUtils]: 93: Hoare triple {30011#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30011#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:23:06,875 INFO L290 TraceCheckUtils]: 92: Hoare triple {30006#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30011#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 06:23:06,875 INFO L290 TraceCheckUtils]: 91: Hoare triple {30006#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {30006#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:23:06,875 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29955#true} {30006#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {30006#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:23:06,875 INFO L290 TraceCheckUtils]: 89: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,875 INFO L290 TraceCheckUtils]: 88: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,875 INFO L290 TraceCheckUtils]: 87: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,875 INFO L272 TraceCheckUtils]: 86: Hoare triple {30006#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,876 INFO L290 TraceCheckUtils]: 85: Hoare triple {30006#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30006#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:23:06,876 INFO L290 TraceCheckUtils]: 84: Hoare triple {30001#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30006#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 06:23:06,876 INFO L290 TraceCheckUtils]: 83: Hoare triple {30001#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {30001#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:23:06,877 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29955#true} {30001#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {30001#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:23:06,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,877 INFO L290 TraceCheckUtils]: 80: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,877 INFO L290 TraceCheckUtils]: 79: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,877 INFO L272 TraceCheckUtils]: 78: Hoare triple {30001#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {30001#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30001#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:23:06,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {29996#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30001#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 06:23:06,878 INFO L290 TraceCheckUtils]: 75: Hoare triple {29996#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {29996#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:23:06,878 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29955#true} {29996#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {29996#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:23:06,878 INFO L290 TraceCheckUtils]: 73: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,878 INFO L272 TraceCheckUtils]: 70: Hoare triple {29996#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {29996#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29996#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:23:06,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {29991#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29996#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 06:23:06,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {29991#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {29991#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:23:06,880 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29955#true} {29991#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {29991#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:23:06,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,880 INFO L272 TraceCheckUtils]: 62: Hoare triple {29991#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,880 INFO L290 TraceCheckUtils]: 61: Hoare triple {29991#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29991#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:23:06,880 INFO L290 TraceCheckUtils]: 60: Hoare triple {29986#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29991#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 06:23:06,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {29986#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {29986#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:23:06,881 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29955#true} {29986#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {29986#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:23:06,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,881 INFO L290 TraceCheckUtils]: 55: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,881 INFO L272 TraceCheckUtils]: 54: Hoare triple {29986#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {29986#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29986#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:23:06,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {29981#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29986#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 06:23:06,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {29981#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {29981#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:23:06,883 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29955#true} {29981#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {29981#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:23:06,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,883 INFO L272 TraceCheckUtils]: 46: Hoare triple {29981#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {29981#(<= main_~n~0 (+ main_~i~1 13))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29981#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:23:06,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {30853#(<= main_~n~0 (+ main_~i~1 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29981#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 06:23:06,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {30853#(<= main_~n~0 (+ main_~i~1 14))} havoc #t~mem5; {30853#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 06:23:06,884 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29955#true} {30853#(<= main_~n~0 (+ main_~i~1 14))} #68#return; {30853#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 06:23:06,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-15 06:23:06,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-15 06:23:06,884 INFO L272 TraceCheckUtils]: 38: Hoare triple {30853#(<= main_~n~0 (+ main_~i~1 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29955#true} is VALID [2022-04-15 06:23:06,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {30853#(<= main_~n~0 (+ main_~i~1 14))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {30853#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 06:23:06,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {29975#(<= main_~n~0 14)} ~i~1 := 0; {30853#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 06:23:06,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {29974#(<= main_~i~0 14)} assume !(~i~0 < ~n~0); {29975#(<= main_~n~0 14)} is VALID [2022-04-15 06:23:06,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {29973#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29974#(<= main_~i~0 14)} is VALID [2022-04-15 06:23:06,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {29973#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29973#(<= main_~i~0 13)} is VALID [2022-04-15 06:23:06,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {29972#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29973#(<= main_~i~0 13)} is VALID [2022-04-15 06:23:06,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {29972#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29972#(<= main_~i~0 12)} is VALID [2022-04-15 06:23:06,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {29971#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29972#(<= main_~i~0 12)} is VALID [2022-04-15 06:23:06,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {29971#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29971#(<= main_~i~0 11)} is VALID [2022-04-15 06:23:06,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {29970#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29971#(<= main_~i~0 11)} is VALID [2022-04-15 06:23:06,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {29970#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29970#(<= main_~i~0 10)} is VALID [2022-04-15 06:23:06,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {29969#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29970#(<= main_~i~0 10)} is VALID [2022-04-15 06:23:06,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {29969#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29969#(<= main_~i~0 9)} is VALID [2022-04-15 06:23:06,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {29968#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29969#(<= main_~i~0 9)} is VALID [2022-04-15 06:23:06,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {29968#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29968#(<= main_~i~0 8)} is VALID [2022-04-15 06:23:06,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {29967#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29968#(<= main_~i~0 8)} is VALID [2022-04-15 06:23:06,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {29967#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29967#(<= main_~i~0 7)} is VALID [2022-04-15 06:23:06,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {29966#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29967#(<= main_~i~0 7)} is VALID [2022-04-15 06:23:06,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {29966#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29966#(<= main_~i~0 6)} is VALID [2022-04-15 06:23:06,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {29965#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29966#(<= main_~i~0 6)} is VALID [2022-04-15 06:23:06,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {29965#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29965#(<= main_~i~0 5)} is VALID [2022-04-15 06:23:06,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {29964#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29965#(<= main_~i~0 5)} is VALID [2022-04-15 06:23:06,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {29964#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29964#(<= main_~i~0 4)} is VALID [2022-04-15 06:23:06,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {29963#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29964#(<= main_~i~0 4)} is VALID [2022-04-15 06:23:06,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {29963#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29963#(<= main_~i~0 3)} is VALID [2022-04-15 06:23:06,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {29962#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29963#(<= main_~i~0 3)} is VALID [2022-04-15 06:23:06,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {29962#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29962#(<= main_~i~0 2)} is VALID [2022-04-15 06:23:06,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {29961#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29962#(<= main_~i~0 2)} is VALID [2022-04-15 06:23:06,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {29961#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29961#(<= main_~i~0 1)} is VALID [2022-04-15 06:23:06,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {30069#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29961#(<= main_~i~0 1)} is VALID [2022-04-15 06:23:06,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {30069#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {30069#(<= main_~i~0 0)} is VALID [2022-04-15 06:23:06,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {29955#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {30069#(<= main_~i~0 0)} is VALID [2022-04-15 06:23:06,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {29955#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29955#true} is VALID [2022-04-15 06:23:06,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {29955#true} call #t~ret6 := main(); {29955#true} is VALID [2022-04-15 06:23:06,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29955#true} #70#return; {29955#true} is VALID [2022-04-15 06:23:06,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-15 06:23:06,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#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(9, 2); {29955#true} is VALID [2022-04-15 06:23:06,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {29955#true} call ULTIMATE.init(); {29955#true} is VALID [2022-04-15 06:23:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 420 proven. 196 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 06:23:06,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271665947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:23:06,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:23:06,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 51 [2022-04-15 06:23:06,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:23:06,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1608428307] [2022-04-15 06:23:06,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1608428307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:23:06,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:23:06,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:23:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378108143] [2022-04-15 06:23:06,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:23:06,896 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 154 [2022-04-15 06:23:06,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:23:06,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:23:06,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:06,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:23:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:06,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:23:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1983, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:23:06,961 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:23:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:08,746 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2022-04-15 06:23:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:23:08,746 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 154 [2022-04-15 06:23:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:23:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:23:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-15 06:23:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:23:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-15 06:23:08,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 134 transitions. [2022-04-15 06:23:08,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:08,857 INFO L225 Difference]: With dead ends: 228 [2022-04-15 06:23:08,857 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 06:23:08,858 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1162, Invalid=5480, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:23:08,862 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:23:08,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 83 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:23:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 06:23:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-04-15 06:23:09,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:23:09,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:23:09,029 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:23:09,029 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:23:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:09,031 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-15 06:23:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-15 06:23:09,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:09,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:09,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-15 06:23:09,032 INFO L87 Difference]: Start difference. First operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-15 06:23:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:23:09,034 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-15 06:23:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-15 06:23:09,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:23:09,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:23:09,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:23:09,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:23:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:23:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-04-15 06:23:09,038 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2022-04-15 06:23:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:23:09,038 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-04-15 06:23:09,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 06:23:09,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 160 transitions. [2022-04-15 06:23:09,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:23:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-04-15 06:23:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-15 06:23:09,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:23:09,293 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:23:09,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 06:23:09,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:23:09,493 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:23:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:23:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 55 times [2022-04-15 06:23:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:23:09,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1250755380] [2022-04-15 06:23:09,496 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:23:09,496 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:23:09,496 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:23:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 56 times [2022-04-15 06:23:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:23:09,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112300116] [2022-04-15 06:23:09,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:23:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:23:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:23:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {32240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {32144#true} is VALID [2022-04-15 06:23:10,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32144#true} {32144#true} #70#return; {32144#true} is VALID [2022-04-15 06:23:10,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 06:23:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} #68#return; {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:23:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:23:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #68#return; {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 06:23:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:23:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 06:23:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 06:23:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-15 06:23:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:23:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-15 06:23:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-15 06:23:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:23:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-15 06:23:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:23:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-15 06:23:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:23:10,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-04-15 06:23:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-04-15 06:23:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:23:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-04-15 06:23:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:23:10,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-15 06:23:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:23:10,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {32144#true} call ULTIMATE.init(); {32240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:23:10,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {32240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(9, 2); {32144#true} is VALID [2022-04-15 06:23:10,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32144#true} #70#return; {32144#true} is VALID [2022-04-15 06:23:10,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {32144#true} call #t~ret6 := main(); {32144#true} is VALID [2022-04-15 06:23:10,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {32144#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {32144#true} is VALID [2022-04-15 06:23:10,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {32144#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {32149#(= main_~i~0 0)} is VALID [2022-04-15 06:23:10,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {32149#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32149#(= main_~i~0 0)} is VALID [2022-04-15 06:23:10,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {32149#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32150#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:23:10,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {32150#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32150#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 06:23:10,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {32150#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32151#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:23:10,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {32151#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32151#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:23:10,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {32151#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32152#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:23:10,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {32152#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32152#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 06:23:10,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {32152#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32153#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:23:10,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {32153#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32153#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:23:10,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {32153#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32154#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:23:10,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {32154#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32154#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 06:23:10,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {32154#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32155#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:23:10,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {32155#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32155#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 06:23:10,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {32155#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32156#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:23:10,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {32156#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32156#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 06:23:10,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {32156#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32157#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:23:10,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {32157#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32157#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 06:23:10,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {32157#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32158#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:23:10,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {32158#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32158#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 06:23:10,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {32158#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32159#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:23:10,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {32159#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32159#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 06:23:10,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {32159#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32160#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:23:10,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {32160#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32160#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 06:23:10,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {32160#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32161#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 06:23:10,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {32161#(and (<= 12 main_~i~0) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32161#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 06:23:10,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {32161#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32162#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 06:23:10,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {32162#(and (<= main_~i~0 13) (<= 13 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32162#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 06:23:10,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {32162#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32163#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 06:23:10,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {32163#(and (<= main_~i~0 14) (<= 14 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32164#(and (<= main_~i~0 14) (<= 14 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-15 06:23:10,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {32164#(and (<= main_~i~0 14) (<= 14 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32165#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} is VALID [2022-04-15 06:23:10,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {32165#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} assume !(~i~0 < ~n~0); {32165#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} is VALID [2022-04-15 06:23:10,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {32165#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} ~i~1 := 0; {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:23:10,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:23:10,233 INFO L272 TraceCheckUtils]: 40: Hoare triple {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,233 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {32144#true} {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} #68#return; {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:23:10,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} havoc #t~mem5; {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-15 06:23:10,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {32166#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,234 INFO L272 TraceCheckUtils]: 48: Hoare triple {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,235 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {32144#true} {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #68#return; {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} havoc #t~mem5; {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {32171#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:23:10,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:23:10,236 INFO L272 TraceCheckUtils]: 56: Hoare triple {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,237 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {32144#true} {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:23:10,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} havoc #t~mem5; {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 06:23:10,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {32176#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,238 INFO L290 TraceCheckUtils]: 63: Hoare triple {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,238 INFO L272 TraceCheckUtils]: 64: Hoare triple {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,239 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {32144#true} {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {32181#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,240 INFO L272 TraceCheckUtils]: 72: Hoare triple {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,240 INFO L290 TraceCheckUtils]: 74: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,240 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {32144#true} {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,241 INFO L290 TraceCheckUtils]: 77: Hoare triple {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,241 INFO L290 TraceCheckUtils]: 78: Hoare triple {32186#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:23:10,241 INFO L290 TraceCheckUtils]: 79: Hoare triple {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:23:10,241 INFO L272 TraceCheckUtils]: 80: Hoare triple {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,241 INFO L290 TraceCheckUtils]: 81: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,242 INFO L290 TraceCheckUtils]: 82: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,242 INFO L290 TraceCheckUtils]: 83: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,242 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {32144#true} {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:23:10,242 INFO L290 TraceCheckUtils]: 85: Hoare triple {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 06:23:10,243 INFO L290 TraceCheckUtils]: 86: Hoare triple {32191#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,243 INFO L290 TraceCheckUtils]: 87: Hoare triple {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,243 INFO L272 TraceCheckUtils]: 88: Hoare triple {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,243 INFO L290 TraceCheckUtils]: 89: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,243 INFO L290 TraceCheckUtils]: 90: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,243 INFO L290 TraceCheckUtils]: 91: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,244 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32144#true} {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,244 INFO L290 TraceCheckUtils]: 93: Hoare triple {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,245 INFO L290 TraceCheckUtils]: 94: Hoare triple {32196#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:23:10,245 INFO L290 TraceCheckUtils]: 95: Hoare triple {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:23:10,245 INFO L272 TraceCheckUtils]: 96: Hoare triple {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,245 INFO L290 TraceCheckUtils]: 97: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,245 INFO L290 TraceCheckUtils]: 98: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,245 INFO L290 TraceCheckUtils]: 99: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,246 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {32144#true} {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:23:10,246 INFO L290 TraceCheckUtils]: 101: Hoare triple {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 06:23:10,246 INFO L290 TraceCheckUtils]: 102: Hoare triple {32201#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:23:10,247 INFO L290 TraceCheckUtils]: 103: Hoare triple {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:23:10,247 INFO L272 TraceCheckUtils]: 104: Hoare triple {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,247 INFO L290 TraceCheckUtils]: 105: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,247 INFO L290 TraceCheckUtils]: 106: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,247 INFO L290 TraceCheckUtils]: 107: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,247 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32144#true} {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:23:10,247 INFO L290 TraceCheckUtils]: 109: Hoare triple {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 06:23:10,248 INFO L290 TraceCheckUtils]: 110: Hoare triple {32206#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:23:10,248 INFO L290 TraceCheckUtils]: 111: Hoare triple {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:23:10,248 INFO L272 TraceCheckUtils]: 112: Hoare triple {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,248 INFO L290 TraceCheckUtils]: 113: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,248 INFO L290 TraceCheckUtils]: 114: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,248 INFO L290 TraceCheckUtils]: 115: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,249 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {32144#true} {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:23:10,249 INFO L290 TraceCheckUtils]: 117: Hoare triple {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 06:23:10,250 INFO L290 TraceCheckUtils]: 118: Hoare triple {32211#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,250 INFO L290 TraceCheckUtils]: 119: Hoare triple {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,250 INFO L272 TraceCheckUtils]: 120: Hoare triple {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,250 INFO L290 TraceCheckUtils]: 121: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,250 INFO L290 TraceCheckUtils]: 122: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,250 INFO L290 TraceCheckUtils]: 123: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,251 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {32144#true} {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,251 INFO L290 TraceCheckUtils]: 125: Hoare triple {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,251 INFO L290 TraceCheckUtils]: 126: Hoare triple {32216#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:23:10,252 INFO L290 TraceCheckUtils]: 127: Hoare triple {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:23:10,252 INFO L272 TraceCheckUtils]: 128: Hoare triple {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,252 INFO L290 TraceCheckUtils]: 129: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,252 INFO L290 TraceCheckUtils]: 130: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,252 INFO L290 TraceCheckUtils]: 131: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,252 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {32144#true} {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:23:10,253 INFO L290 TraceCheckUtils]: 133: Hoare triple {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 06:23:10,253 INFO L290 TraceCheckUtils]: 134: Hoare triple {32221#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:23:10,253 INFO L290 TraceCheckUtils]: 135: Hoare triple {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:23:10,253 INFO L272 TraceCheckUtils]: 136: Hoare triple {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,254 INFO L290 TraceCheckUtils]: 137: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,254 INFO L290 TraceCheckUtils]: 138: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,254 INFO L290 TraceCheckUtils]: 139: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,254 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {32144#true} {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:23:10,254 INFO L290 TraceCheckUtils]: 141: Hoare triple {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 06:23:10,255 INFO L290 TraceCheckUtils]: 142: Hoare triple {32226#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:23:10,255 INFO L290 TraceCheckUtils]: 143: Hoare triple {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:23:10,255 INFO L272 TraceCheckUtils]: 144: Hoare triple {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32144#true} is VALID [2022-04-15 06:23:10,255 INFO L290 TraceCheckUtils]: 145: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-15 06:23:10,255 INFO L290 TraceCheckUtils]: 146: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-15 06:23:10,255 INFO L290 TraceCheckUtils]: 147: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-15 06:23:10,256 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {32144#true} {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:23:10,256 INFO L290 TraceCheckUtils]: 149: Hoare triple {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 06:23:10,257 INFO L290 TraceCheckUtils]: 150: Hoare triple {32231#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32236#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 06:23:10,257 INFO L290 TraceCheckUtils]: 151: Hoare triple {32236#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32237#(= |main_#t~mem5| 0)} is VALID [2022-04-15 06:23:10,257 INFO L272 TraceCheckUtils]: 152: Hoare triple {32237#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:23:10,258 INFO L290 TraceCheckUtils]: 153: Hoare triple {32238#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32239#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:23:10,258 INFO L290 TraceCheckUtils]: 154: Hoare triple {32239#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32145#false} is VALID [2022-04-15 06:23:10,258 INFO L290 TraceCheckUtils]: 155: Hoare triple {32145#false} assume !false; {32145#false} is VALID [2022-04-15 06:23:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 28 proven. 617 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 06:23:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:23:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112300116] [2022-04-15 06:23:10,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112300116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:23:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439078030] [2022-04-15 06:23:10,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:23:10,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:23:10,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:23:10,260 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:23:10,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 06:23:10,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:23:10,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:23:10,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-15 06:23:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:23:10,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:23:10,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11