/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-fb4f59a-m [2022-04-28 03:14:10,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:14:10,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:14:10,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:14:10,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:14:10,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:14:10,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:14:10,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:14:10,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:14:10,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:14:10,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:14:10,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:14:10,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:14:10,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:14:10,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:14:10,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:14:10,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:14:10,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:14:10,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:14:10,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:14:10,848 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:14:10,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:14:10,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:14:10,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:14:10,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:14:10,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:14:10,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:14:10,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:14:10,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:14:10,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:14:10,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:14:10,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:14:10,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:14:10,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:14:10,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:14:10,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:14:10,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:14:10,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:14:10,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:14:10,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:14:10,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:14:10,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:14:10,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:14:10,875 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:14:10,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:14:10,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:14:10,877 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:14:10,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:14:10,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:14:10,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:14:10,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:14:10,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:14:10,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:14:10,878 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:14:10,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:14:10,878 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:14:10,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:14:10,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:14:10,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:14:10,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:14:10,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:14:10,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:14:10,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:14:10,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:14:10,879 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:14:10,879 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:14:10,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:14:10,879 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:14:10,880 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-28 03:14:11,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:14:11,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:14:11,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:14:11,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:14:11,114 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:14:11,115 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-28 03:14:11,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f35c5e5/d745deea05aa4d5f84b83559e5b41e04/FLAGe2756f98c [2022-04-28 03:14:11,536 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:14:11,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-28 03:14:11,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f35c5e5/d745deea05aa4d5f84b83559e5b41e04/FLAGe2756f98c [2022-04-28 03:14:11,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f35c5e5/d745deea05aa4d5f84b83559e5b41e04 [2022-04-28 03:14:11,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:14:11,966 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:14:11,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:14:11,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:14:11,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:14:11,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:14:11" (1/1) ... [2022-04-28 03:14:11,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fcdbf73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:11, skipping insertion in model container [2022-04-28 03:14:11,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:14:11" (1/1) ... [2022-04-28 03:14:11,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:14:11,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:14:12,099 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-28 03:14:12,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:14:12,115 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:14:12,123 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-28 03:14:12,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:14:12,140 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:14:12,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12 WrapperNode [2022-04-28 03:14:12,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:14:12,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:14:12,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:14:12,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:14:12,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12" (1/1) ... [2022-04-28 03:14:12,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12" (1/1) ... [2022-04-28 03:14:12,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12" (1/1) ... [2022-04-28 03:14:12,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12" (1/1) ... [2022-04-28 03:14:12,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12" (1/1) ... [2022-04-28 03:14:12,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12" (1/1) ... [2022-04-28 03:14:12,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12" (1/1) ... [2022-04-28 03:14:12,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:14:12,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:14:12,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:14:12,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:14:12,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12" (1/1) ... [2022-04-28 03:14:12,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:14:12,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:12,193 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-28 03:14:12,207 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-28 03:14:12,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:14:12,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:14:12,225 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:14:12,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:14:12,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:14:12,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:14:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 03:14:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:14:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:14:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:14:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:14:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:14:12,286 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:14:12,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:14:12,437 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:14:12,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:14:12,443 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:14:12,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:14:12 BoogieIcfgContainer [2022-04-28 03:14:12,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:14:12,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:14:12,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:14:12,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:14:12,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:14:11" (1/3) ... [2022-04-28 03:14:12,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0fb4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:14:12, skipping insertion in model container [2022-04-28 03:14:12,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:14:12" (2/3) ... [2022-04-28 03:14:12,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0fb4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:14:12, skipping insertion in model container [2022-04-28 03:14:12,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:14:12" (3/3) ... [2022-04-28 03:14:12,450 INFO L111 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2022-04-28 03:14:12,470 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:14:12,470 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:14:12,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:14:12,506 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6cf73344, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@901b4f7 [2022-04-28 03:14:12,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:14:12,512 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-28 03:14:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:14:12,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:12,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:12,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 1 times [2022-04-28 03:14:12,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:12,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913169864] [2022-04-28 03:14:12,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:14:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 2 times [2022-04-28 03:14:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:12,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623202845] [2022-04-28 03:14:12,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:12,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:12,810 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-28 03:14:12,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 03:14:12,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-28 03:14:12,812 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-28 03:14:12,812 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-28 03:14:12,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 03:14:12,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-28 03:14:12,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2022-04-28 03:14:12,813 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-28 03:14:12,814 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-28 03:14:12,814 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-28 03:14:12,815 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-28 03:14:12,816 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-28 03:14:12,816 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-28 03:14:12,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-28 03:14:12,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-28 03:14:12,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 03:14:12,817 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-28 03:14:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:12,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623202845] [2022-04-28 03:14:12,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623202845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:12,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:12,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:14:12,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:12,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913169864] [2022-04-28 03:14:12,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913169864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:12,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:12,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:14:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178476878] [2022-04-28 03:14:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:12,825 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-28 03:14:12,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:12,829 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-28 03:14:12,844 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-28 03:14:12,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:14:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:14:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:14:12,863 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-28 03:14:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:13,090 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-28 03:14:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:14:13,091 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-28 03:14:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:13,092 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-28 03:14:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-28 03:14:13,111 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-28 03:14:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-28 03:14:13,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-28 03:14:13,169 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-28 03:14:13,176 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:14:13,177 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 03:14:13,179 INFO L412 NwaCegarLoop]: 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-28 03:14:13,184 INFO L413 NwaCegarLoop]: 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-28 03:14:13,187 INFO L414 NwaCegarLoop]: 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-28 03:14:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 03:14:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 03:14:13,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:13,210 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-28 03:14:13,211 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-28 03:14:13,211 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-28 03:14:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:13,215 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 03:14:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 03:14:13,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:13,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:13,216 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-28 03:14:13,217 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-28 03:14:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:13,219 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 03:14:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 03:14:13,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:13,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:13,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:13,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:13,223 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-28 03:14:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 03:14:13,234 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-28 03:14:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:13,234 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 03:14:13,234 INFO L496 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-28 03:14:13,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 03:14:13,253 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-28 03:14:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 03:14:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:14:13,254 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:13,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:14:13,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:14:13,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 1 times [2022-04-28 03:14:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:13,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219211378] [2022-04-28 03:14:13,273 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:13,273 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:13,273 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 2 times [2022-04-28 03:14:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:13,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372312098] [2022-04-28 03:14:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:13,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:13,472 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-28 03:14:13,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 03:14:13,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-28 03:14:13,474 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-28 03:14:13,474 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-28 03:14:13,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 03:14:13,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-28 03:14:13,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-28 03:14:13,474 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-28 03:14:13,475 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-28 03:14:13,476 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-28 03:14:13,476 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-28 03:14:13,477 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-28 03:14:13,477 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-28 03:14:13,478 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-28 03:14:13,478 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-28 03:14:13,479 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-28 03:14:13,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {228#false} is VALID [2022-04-28 03:14:13,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-28 03:14:13,480 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-28 03:14:13,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:13,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372312098] [2022-04-28 03:14:13,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372312098] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:13,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342757806] [2022-04-28 03:14:13,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:14:13,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:13,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:13,491 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-28 03:14:13,493 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-28 03:14:13,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:14:13,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:13,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 03:14:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:13,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:13,676 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-28 03:14:13,762 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-28 03:14:13,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-28 03:14:13,811 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-28 03:14:13,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 03:14:13,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-28 03:14:13,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-28 03:14:13,812 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-28 03:14:13,812 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-28 03:14:13,813 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-28 03:14:13,814 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-28 03:14:13,815 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-28 03:14:13,815 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-28 03:14:13,816 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-28 03:14:13,819 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-28 03:14:13,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:13,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-28 03:14:13,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-28 03:14:13,822 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-28 03:14:13,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:13,944 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-28 03:14:13,947 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-28 03:14:13,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-28 03:14:13,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-28 03:14:13,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:13,981 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-28 03:14:13,982 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-28 03:14:13,983 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-28 03:14:13,984 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-28 03:14:13,984 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-28 03:14:13,985 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-28 03:14:13,985 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-28 03:14:13,985 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-28 03:14:13,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-28 03:14:13,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-28 03:14:13,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 03:14:13,986 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-28 03:14:13,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-28 03:14:13,986 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-28 03:14:13,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342757806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:13,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:13,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2022-04-28 03:14:13,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:13,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219211378] [2022-04-28 03:14:13,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219211378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:13,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:13,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:14:13,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705297680] [2022-04-28 03:14:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:13,989 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-28 03:14:13,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:13,990 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-28 03:14:14,001 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-28 03:14:14,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:14:14,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:14,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:14:14,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:14:14,004 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-28 03:14:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:14,353 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 03:14:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:14:14,354 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-28 03:14:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:14,355 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-28 03:14:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 03:14:14,359 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-28 03:14:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 03:14:14,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-28 03:14:14,394 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-28 03:14:14,396 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:14:14,396 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:14:14,396 INFO L412 NwaCegarLoop]: 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-28 03:14:14,400 INFO L413 NwaCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:14,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 48 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:14:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:14:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-28 03:14:14,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:14,408 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-28 03:14:14,409 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-28 03:14:14,410 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-28 03:14:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:14,412 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 03:14:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 03:14:14,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:14,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:14,413 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-28 03:14:14,413 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-28 03:14:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:14,415 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 03:14:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 03:14:14,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:14,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:14,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:14,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:14,416 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-28 03:14:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-28 03:14:14,417 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2022-04-28 03:14:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:14,417 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-28 03:14:14,418 INFO L496 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-28 03:14:14,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-28 03:14:14,460 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-28 03:14:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 03:14:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:14:14,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:14,461 INFO L195 NwaCegarLoop]: 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-28 03:14:14,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:14:14,670 WARN L477 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-28 03:14:14,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:14,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 1 times [2022-04-28 03:14:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:14,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1473861829] [2022-04-28 03:14:14,674 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:14,674 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:14,674 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 2 times [2022-04-28 03:14:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:14,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298928899] [2022-04-28 03:14:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:14,775 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-28 03:14:14,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 03:14:14,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-28 03:14:14,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 03:14:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:14,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-28 03:14:14,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-28 03:14:14,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 03:14:14,794 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-28 03:14:14,794 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-28 03:14:14,795 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-28 03:14:14,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 03:14:14,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-28 03:14:14,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-28 03:14:14,795 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-28 03:14:14,795 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-28 03:14:14,796 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-28 03:14:14,796 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-28 03:14:14,796 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-28 03:14:14,797 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-28 03:14:14,797 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-28 03:14:14,797 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-28 03:14:14,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-28 03:14:14,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-28 03:14:14,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 03:14:14,799 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-28 03:14:14,799 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-28 03:14:14,799 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-28 03:14:14,800 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-28 03:14:14,800 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-28 03:14:14,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-28 03:14:14,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-28 03:14:14,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-28 03:14:14,801 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-28 03:14:14,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:14,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298928899] [2022-04-28 03:14:14,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298928899] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:14,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713050332] [2022-04-28 03:14:14,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:14:14,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:14,803 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-28 03:14:14,804 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-28 03:14:14,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:14:14,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:14,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:14:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:14,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:14,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-28 03:14:14,995 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-28 03:14:14,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 03:14:14,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-28 03:14:14,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-28 03:14:14,995 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-28 03:14:14,997 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-28 03:14:14,998 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-28 03:14:14,998 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-28 03:14:14,998 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-28 03:14:14,999 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-28 03:14:14,999 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-28 03:14:14,999 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-28 03:14:14,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-28 03:14:15,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-28 03:14:15,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 03:14:15,001 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-28 03:14:15,001 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-28 03:14:15,002 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-28 03:14:15,003 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-28 03:14:15,003 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-28 03:14:15,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-28 03:14:15,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-28 03:14:15,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-28 03:14:15,004 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-28 03:14:15,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:15,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-28 03:14:15,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-28 03:14:15,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-28 03:14:15,167 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-28 03:14:15,168 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-28 03:14:15,168 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-28 03:14:15,169 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-28 03:14:15,169 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-28 03:14:15,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 03:14:15,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-28 03:14:15,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-28 03:14:15,170 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-28 03:14:15,170 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-28 03:14:15,170 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-28 03:14:15,171 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-28 03:14:15,171 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-28 03:14:15,171 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-28 03:14:15,172 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-28 03:14:15,172 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-28 03:14:15,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-28 03:14:15,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-28 03:14:15,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 03:14:15,172 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-28 03:14:15,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-28 03:14:15,173 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-28 03:14:15,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713050332] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:15,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:15,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-28 03:14:15,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:15,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1473861829] [2022-04-28 03:14:15,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1473861829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:15,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:15,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:14:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212427772] [2022-04-28 03:14:15,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:15,174 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-28 03:14:15,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:15,174 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-28 03:14:15,208 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-28 03:14:15,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:14:15,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:15,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:14:15,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:14:15,209 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-28 03:14:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:15,417 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 03:14:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:14:15,417 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-28 03:14:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:15,418 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-28 03:14:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 03:14:15,419 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-28 03:14:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 03:14:15,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 03:14:15,448 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-28 03:14:15,449 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:14:15,449 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:14:15,449 INFO L412 NwaCegarLoop]: 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-28 03:14:15,450 INFO L413 NwaCegarLoop]: 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-28 03:14:15,450 INFO L414 NwaCegarLoop]: 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-28 03:14:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:14:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 03:14:15,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:15,456 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-28 03:14:15,456 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-28 03:14:15,456 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-28 03:14:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:15,458 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 03:14:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 03:14:15,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:15,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:15,458 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-28 03:14:15,459 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-28 03:14:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:15,460 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 03:14:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 03:14:15,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:15,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:15,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:15,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:15,460 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-28 03:14:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 03:14:15,461 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2022-04-28 03:14:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:15,461 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 03:14:15,461 INFO L496 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-28 03:14:15,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 03:14:15,488 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-28 03:14:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 03:14:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:14:15,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:15,489 INFO L195 NwaCegarLoop]: 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-28 03:14:15,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:15,707 WARN L477 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-28 03:14:15,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 3 times [2022-04-28 03:14:15,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:15,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [928695599] [2022-04-28 03:14:15,710 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:15,710 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:15,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 4 times [2022-04-28 03:14:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:15,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881588483] [2022-04-28 03:14:15,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:15,833 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-28 03:14:15,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 03:14:15,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-28 03:14:15,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 03:14:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:15,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-28 03:14:15,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-28 03:14:15,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 03:14:15,839 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-28 03:14:15,840 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-28 03:14:15,840 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-28 03:14:15,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 03:14:15,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-28 03:14:15,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-28 03:14:15,840 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-28 03:14:15,841 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-28 03:14:15,841 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-28 03:14:15,841 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-28 03:14:15,842 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-28 03:14:15,842 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-28 03:14:15,843 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-28 03:14:15,843 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-28 03:14:15,843 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-28 03:14:15,844 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-28 03:14:15,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-28 03:14:15,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-28 03:14:15,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 03:14:15,845 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-28 03:14:15,846 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-28 03:14:15,846 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-28 03:14:15,846 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-28 03:14:15,847 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-28 03:14:15,847 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-28 03:14:15,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {933#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {917#false} is VALID [2022-04-28 03:14:15,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-28 03:14:15,848 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-28 03:14:15,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881588483] [2022-04-28 03:14:15,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881588483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777003709] [2022-04-28 03:14:15,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:14:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:15,849 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-28 03:14:15,850 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-28 03:14:15,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:14:15,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:15,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:14:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:15,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:15,945 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-28 03:14:17,094 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:14:17,094 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-28 03:14:17,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {916#true} is VALID [2022-04-28 03:14:17,158 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-28 03:14:17,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 03:14:17,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-28 03:14:17,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-28 03:14:17,158 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-28 03:14:17,162 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-28 03:14:17,162 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-28 03:14:17,163 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-28 03:14:17,163 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-28 03:14:17,165 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-28 03:14:17,166 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-28 03:14:17,167 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-28 03:14:17,168 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-28 03:14:17,174 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-28 03:14:17,175 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-28 03:14:17,175 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-28 03:14:17,176 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-28 03:14:17,176 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-28 03:14:17,177 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-28 03:14:17,181 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-28 03:14:17,182 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-28 03:14:17,184 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-28 03:14:17,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {1012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:17,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {1016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {917#false} is VALID [2022-04-28 03:14:17,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-28 03:14:17,185 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-28 03:14:17,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:17,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777003709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:17,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:14:17,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-04-28 03:14:17,474 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:17,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [928695599] [2022-04-28 03:14:17,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [928695599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:17,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:17,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:14:17,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819024166] [2022-04-28 03:14:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:17,475 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-28 03:14:17,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:17,476 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-28 03:14:17,491 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-28 03:14:17,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:14:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:14:17,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:14:17,492 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-28 03:14:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:18,019 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-28 03:14:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:14:18,020 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-28 03:14:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:18,020 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-28 03:14:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 03:14:18,022 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-28 03:14:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 03:14:18,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-28 03:14:18,055 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-28 03:14:18,056 INFO L225 Difference]: With dead ends: 42 [2022-04-28 03:14:18,056 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 03:14:18,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:14:18,057 INFO L413 NwaCegarLoop]: 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-28 03:14:18,057 INFO L414 NwaCegarLoop]: 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-28 03:14:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 03:14:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-28 03:14:18,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:18,064 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-28 03:14:18,064 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-28 03:14:18,064 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-28 03:14:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:18,066 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 03:14:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 03:14:18,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:18,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:18,066 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-28 03:14:18,066 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-28 03:14:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:18,067 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 03:14:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 03:14:18,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:18,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:18,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:18,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:18,068 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-28 03:14:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-28 03:14:18,069 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2022-04-28 03:14:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:18,069 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-28 03:14:18,069 INFO L496 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-28 03:14:18,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-28 03:14:18,102 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-28 03:14:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 03:14:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:14:18,103 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:18,103 INFO L195 NwaCegarLoop]: 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-28 03:14:18,122 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-28 03:14:18,322 WARN L477 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-28 03:14:18,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 5 times [2022-04-28 03:14:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:18,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1553807307] [2022-04-28 03:14:18,325 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:18,325 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:18,325 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 6 times [2022-04-28 03:14:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:18,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996744843] [2022-04-28 03:14:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:18,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:18,426 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-28 03:14:18,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-28 03:14:18,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 03:14:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:18,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 03:14:18,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 03:14:18,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,444 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-28 03:14:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 03:14:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:18,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 03:14:18,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 03:14:18,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,458 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-28 03:14:18,458 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-28 03:14:18,458 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-28 03:14:18,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-28 03:14:18,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-28 03:14:18,459 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-28 03:14:18,459 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-28 03:14:18,459 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-28 03:14:18,460 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-28 03:14:18,460 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-28 03:14:18,460 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-28 03:14:18,461 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-28 03:14:18,461 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-28 03:14:18,462 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-28 03:14:18,462 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-28 03:14:18,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 03:14:18,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 03:14:18,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,463 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-28 03:14:18,463 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-28 03:14:18,464 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-28 03:14:18,464 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-28 03:14:18,464 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-28 03:14:18,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 03:14:18,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 03:14:18,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,465 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-28 03:14:18,465 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-28 03:14:18,466 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-28 03:14:18,469 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-28 03:14:18,469 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-28 03:14:18,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-28 03:14:18,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-28 03:14:18,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-28 03:14:18,470 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-28 03:14:18,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:18,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996744843] [2022-04-28 03:14:18,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996744843] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:18,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735589734] [2022-04-28 03:14:18,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:14:18,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:18,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:18,472 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-28 03:14:18,472 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-28 03:14:18,526 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 03:14:18,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:18,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:14:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:18,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:18,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-28 03:14:18,765 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-28 03:14:18,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-28 03:14:18,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-28 03:14:18,769 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-28 03:14:18,770 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-28 03:14:18,770 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-28 03:14:18,770 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-28 03:14:18,771 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-28 03:14:18,771 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-28 03:14:18,771 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-28 03:14:18,772 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-28 03:14:18,772 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-28 03:14:18,772 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-28 03:14:18,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 03:14:18,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 03:14:18,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,773 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-28 03:14:18,774 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-28 03:14:18,774 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-28 03:14:18,775 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-28 03:14:18,775 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-28 03:14:18,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 03:14:18,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 03:14:18,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,775 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-28 03:14:18,776 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-28 03:14:18,776 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-28 03:14:18,777 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-28 03:14:18,777 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-28 03:14:18,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-28 03:14:18,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-28 03:14:18,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-28 03:14:18,779 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-28 03:14:18,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:18,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-28 03:14:18,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-28 03:14:18,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-28 03:14:18,933 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-28 03:14:18,933 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-28 03:14:18,934 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-28 03:14:18,934 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-28 03:14:18,935 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-28 03:14:18,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 03:14:18,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 03:14:18,935 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-28 03:14:18,936 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-28 03:14:18,936 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-28 03:14:18,936 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-28 03:14:18,937 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-28 03:14:18,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 03:14:18,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 03:14:18,937 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-28 03:14:18,938 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-28 03:14:18,938 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-28 03:14:18,939 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-28 03:14:18,939 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-28 03:14:18,939 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-28 03:14:18,940 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-28 03:14:18,940 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-28 03:14:18,941 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-28 03:14:18,941 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-28 03:14:18,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-28 03:14:18,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-28 03:14:18,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 03:14:18,941 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-28 03:14:18,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-28 03:14:18,941 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-28 03:14:18,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735589734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:18,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:18,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-04-28 03:14:18,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:18,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1553807307] [2022-04-28 03:14:18,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1553807307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:18,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:18,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:14:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850333519] [2022-04-28 03:14:18,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:18,942 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-28 03:14:18,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:18,943 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-28 03:14:18,965 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-28 03:14:18,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:14:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:18,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:14:18,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:14:18,966 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-28 03:14:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:19,258 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 03:14:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:14:19,258 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-28 03:14:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:19,259 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-28 03:14:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 03:14:19,260 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-28 03:14:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 03:14:19,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-28 03:14:19,295 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-28 03:14:19,296 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:14:19,296 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 03:14:19,296 INFO L412 NwaCegarLoop]: 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-28 03:14:19,297 INFO L413 NwaCegarLoop]: 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-28 03:14:19,297 INFO L414 NwaCegarLoop]: 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-28 03:14:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 03:14:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-28 03:14:19,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:19,305 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-28 03:14:19,305 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-28 03:14:19,305 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-28 03:14:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:19,306 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 03:14:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 03:14:19,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:19,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:19,307 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-28 03:14:19,307 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-28 03:14:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:19,308 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 03:14:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 03:14:19,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:19,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:19,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:19,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:19,308 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-28 03:14:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-28 03:14:19,309 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-04-28 03:14:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:19,309 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-28 03:14:19,310 INFO L496 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-28 03:14:19,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-28 03:14:19,342 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-28 03:14:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-28 03:14:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:14:19,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:19,343 INFO L195 NwaCegarLoop]: 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-28 03:14:19,360 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-28 03:14:19,559 WARN L477 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-28 03:14:19,559 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 7 times [2022-04-28 03:14:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:19,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [482039909] [2022-04-28 03:14:19,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:19,562 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:19,562 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 8 times [2022-04-28 03:14:19,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:19,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689519275] [2022-04-28 03:14:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:19,712 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-28 03:14:19,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 03:14:19,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-28 03:14:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:14:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:19,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-28 03:14:19,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-28 03:14:19,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 03:14:19,718 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-28 03:14:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:14:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:19,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-28 03:14:19,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-28 03:14:19,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 03:14:19,723 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-28 03:14:19,724 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-28 03:14:19,724 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-28 03:14:19,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 03:14:19,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-28 03:14:19,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-28 03:14:19,724 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-28 03:14:19,724 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-28 03:14:19,725 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-28 03:14:19,725 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-28 03:14:19,725 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-28 03:14:19,726 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-28 03:14:19,727 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-28 03:14:19,728 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-28 03:14:19,728 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-28 03:14:19,728 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-28 03:14:19,729 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-28 03:14:19,729 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-28 03:14:19,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-28 03:14:19,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-28 03:14:19,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 03:14:19,729 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-28 03:14:19,730 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-28 03:14:19,730 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-28 03:14:19,730 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-28 03:14:19,731 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-28 03:14:19,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-28 03:14:19,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-28 03:14:19,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 03:14:19,731 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-28 03:14:19,732 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-28 03:14:19,732 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-28 03:14:19,732 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-28 03:14:19,733 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-28 03:14:19,733 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-28 03:14:19,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {1850#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1828#false} is VALID [2022-04-28 03:14:19,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-28 03:14:19,734 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-28 03:14:19,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:19,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689519275] [2022-04-28 03:14:19,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689519275] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:19,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278052014] [2022-04-28 03:14:19,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:14:19,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:19,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:19,735 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-28 03:14:19,736 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-28 03:14:19,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:14:19,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:19,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:14:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:19,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:19,873 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-28 03:14:21,848 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:14:21,849 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-28 03:14:21,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {1827#true} call ULTIMATE.init(); {1827#true} is VALID [2022-04-28 03:14:21,921 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-28 03:14:21,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 03:14:21,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-28 03:14:21,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-28 03:14:21,921 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-28 03:14:21,922 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-28 03:14:21,923 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-28 03:14:21,924 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-28 03:14:21,925 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-28 03:14:21,926 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-28 03:14:21,932 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-28 03:14:21,933 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-28 03:14:21,936 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-28 03:14:21,936 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-28 03:14:21,937 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-28 03:14:21,940 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-28 03:14:21,941 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-28 03:14:21,941 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-28 03:14:21,941 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-28 03:14:21,942 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-28 03:14:21,943 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-28 03:14:21,955 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-28 03:14:21,956 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-28 03:14:21,959 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-28 03:14:21,959 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-28 03:14:21,959 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-28 03:14:21,960 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-28 03:14:21,960 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-28 03:14:21,961 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-28 03:14:21,961 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-28 03:14:21,962 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-28 03:14:21,962 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-28 03:14:21,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {1961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:21,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {1965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1828#false} is VALID [2022-04-28 03:14:21,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-28 03:14:21,964 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-28 03:14:21,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:22,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278052014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:22,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:14:22,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-04-28 03:14:22,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:22,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [482039909] [2022-04-28 03:14:22,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [482039909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:22,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:22,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:14:22,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974000634] [2022-04-28 03:14:22,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:22,248 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-28 03:14:22,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:22,248 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-28 03:14:22,275 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-28 03:14:22,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:14:22,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:22,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:14:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:14:22,276 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-28 03:14:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:23,020 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-04-28 03:14:23,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:14:23,020 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-28 03:14:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:23,020 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-28 03:14:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-28 03:14:23,025 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-28 03:14:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-28 03:14:23,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-28 03:14:23,061 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-28 03:14:23,062 INFO L225 Difference]: With dead ends: 52 [2022-04-28 03:14:23,062 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 03:14:23,063 INFO L412 NwaCegarLoop]: 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-28 03:14:23,063 INFO L413 NwaCegarLoop]: 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-28 03:14:23,063 INFO L414 NwaCegarLoop]: 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-28 03:14:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 03:14:23,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-04-28 03:14:23,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:23,074 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-28 03:14:23,074 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-28 03:14:23,074 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-28 03:14:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:23,075 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 03:14:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-28 03:14:23,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:23,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:23,075 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-28 03:14:23,076 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-28 03:14:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:23,077 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 03:14:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-28 03:14:23,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:23,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:23,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:23,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:23,077 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-28 03:14:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-28 03:14:23,078 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2022-04-28 03:14:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:23,078 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-28 03:14:23,078 INFO L496 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-28 03:14:23,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-28 03:14:23,118 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-28 03:14:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-28 03:14:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:14:23,119 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:23,119 INFO L195 NwaCegarLoop]: 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-28 03:14:23,139 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-28 03:14:23,337 WARN L477 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-28 03:14:23,338 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:23,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 9 times [2022-04-28 03:14:23,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:23,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [748052255] [2022-04-28 03:14:23,341 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:23,341 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:23,341 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 10 times [2022-04-28 03:14:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:23,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430203201] [2022-04-28 03:14:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,435 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-28 03:14:23,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-28 03:14:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 03:14:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:23,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:23,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,441 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-28 03:14:23,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:14:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:23,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:23,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,445 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-28 03:14:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 03:14:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:23,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:23,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,450 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-28 03:14:23,450 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-28 03:14:23,450 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-28 03:14:23,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-28 03:14:23,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-28 03:14:23,450 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-28 03:14:23,451 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-28 03:14:23,451 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-28 03:14:23,451 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-28 03:14:23,452 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-28 03:14:23,452 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-28 03:14:23,452 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-28 03:14:23,453 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-28 03:14:23,453 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-28 03:14:23,453 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-28 03:14:23,454 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-28 03:14:23,454 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-28 03:14:23,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:23,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:23,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,455 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-28 03:14:23,455 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-28 03:14:23,455 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-28 03:14:23,456 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-28 03:14:23,456 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-28 03:14:23,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:23,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:23,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,456 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-28 03:14:23,457 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-28 03:14:23,457 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-28 03:14:23,457 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-28 03:14:23,457 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-28 03:14:23,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:23,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:23,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,458 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-28 03:14:23,458 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-28 03:14:23,459 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-28 03:14:23,459 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-28 03:14:23,459 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-28 03:14:23,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-28 03:14:23,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-28 03:14:23,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-28 03:14:23,459 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-28 03:14:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:23,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430203201] [2022-04-28 03:14:23,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430203201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:23,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919331834] [2022-04-28 03:14:23,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:14:23,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:23,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:23,461 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-28 03:14:23,482 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-28 03:14:23,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:14:23,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:23,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:14:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:23,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:23,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-28 03:14:23,807 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-28 03:14:23,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-28 03:14:23,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-28 03:14:23,807 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-28 03:14:23,808 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-28 03:14:23,808 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-28 03:14:23,809 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-28 03:14:23,809 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-28 03:14:23,809 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-28 03:14:23,810 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-28 03:14:23,810 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-28 03:14:23,811 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-28 03:14:23,811 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-28 03:14:23,811 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-28 03:14:23,811 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-28 03:14:23,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:23,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:23,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,812 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-28 03:14:23,813 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-28 03:14:23,813 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-28 03:14:23,813 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-28 03:14:23,814 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-28 03:14:23,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:23,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:23,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,814 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-28 03:14:23,815 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-28 03:14:23,815 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-28 03:14:23,815 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-28 03:14:23,816 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-28 03:14:23,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:23,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:23,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:23,816 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-28 03:14:23,817 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-28 03:14:23,817 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-28 03:14:23,817 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-28 03:14:23,818 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-28 03:14:23,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-28 03:14:23,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-28 03:14:23,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-28 03:14:23,818 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-28 03:14:23,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:24,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-28 03:14:24,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-28 03:14:24,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-28 03:14:24,000 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-28 03:14:24,001 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-28 03:14:24,001 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-28 03:14:24,001 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-28 03:14:24,002 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-28 03:14:24,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:24,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:24,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:24,002 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-28 03:14:24,002 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-28 03:14:24,003 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-28 03:14:24,003 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-28 03:14:24,004 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-28 03:14:24,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:24,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:24,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:24,004 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-28 03:14:24,004 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-28 03:14:24,005 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-28 03:14:24,005 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-28 03:14:24,005 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-28 03:14:24,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:24,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 03:14:24,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 03:14:24,006 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-28 03:14:24,006 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-28 03:14:24,007 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-28 03:14:24,007 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-28 03:14:24,007 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-28 03:14:24,008 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-28 03:14:24,008 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-28 03:14:24,008 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-28 03:14:24,009 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-28 03:14:24,009 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-28 03:14:24,009 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-28 03:14:24,009 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-28 03:14:24,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-28 03:14:24,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-28 03:14:24,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 03:14:24,010 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-28 03:14:24,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-28 03:14:24,010 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-28 03:14:24,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919331834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:24,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:24,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-04-28 03:14:24,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:24,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [748052255] [2022-04-28 03:14:24,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [748052255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:24,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:24,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:14:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757591982] [2022-04-28 03:14:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:24,011 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-28 03:14:24,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:24,011 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-28 03:14:24,047 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-28 03:14:24,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:14:24,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:24,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:14:24,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:14:24,048 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-28 03:14:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:24,486 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-28 03:14:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:14:24,486 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-28 03:14:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:24,487 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-28 03:14:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-28 03:14:24,488 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-28 03:14:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-28 03:14:24,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-28 03:14:24,529 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-28 03:14:24,529 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:14:24,530 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 03:14:24,530 INFO L412 NwaCegarLoop]: 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-28 03:14:24,531 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:24,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 51 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:14:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 03:14:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-28 03:14:24,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:24,551 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-28 03:14:24,551 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-28 03:14:24,552 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-28 03:14:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:24,553 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 03:14:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-28 03:14:24,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:24,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:24,554 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-28 03:14:24,554 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-28 03:14:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:24,556 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 03:14:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-28 03:14:24,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:24,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:24,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:24,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:24,556 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-28 03:14:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-04-28 03:14:24,558 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2022-04-28 03:14:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:24,558 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-04-28 03:14:24,559 INFO L496 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-28 03:14:24,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 50 transitions. [2022-04-28 03:14:24,602 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-28 03:14:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-28 03:14:24,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 03:14:24,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:24,603 INFO L195 NwaCegarLoop]: 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-28 03:14:24,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:24,809 WARN L477 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-28 03:14:24,810 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 11 times [2022-04-28 03:14:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:24,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [967489069] [2022-04-28 03:14:24,812 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:24,812 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:24,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 12 times [2022-04-28 03:14:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:24,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278877752] [2022-04-28 03:14:24,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:24,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:25,005 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-28 03:14:25,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 03:14:25,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-28 03:14:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 03:14:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:25,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 03:14:25,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 03:14:25,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 03:14:25,010 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-28 03:14:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 03:14:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:25,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 03:14:25,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 03:14:25,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 03:14:25,015 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-28 03:14:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 03:14:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:25,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 03:14:25,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 03:14:25,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 03:14:25,019 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-28 03:14:25,019 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-28 03:14:25,019 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-28 03:14:25,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 03:14:25,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-28 03:14:25,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-28 03:14:25,020 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-28 03:14:25,020 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-28 03:14:25,020 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-28 03:14:25,020 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-28 03:14:25,021 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-28 03:14:25,021 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-28 03:14:25,022 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-28 03:14:25,022 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-28 03:14:25,023 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-28 03:14:25,023 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-28 03:14:25,023 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-28 03:14:25,024 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-28 03:14:25,024 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-28 03:14:25,024 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-28 03:14:25,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 03:14:25,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 03:14:25,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 03:14:25,025 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-28 03:14:25,025 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-28 03:14:25,026 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-28 03:14:25,026 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-28 03:14:25,026 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-28 03:14:25,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 03:14:25,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 03:14:25,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 03:14:25,027 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-28 03:14:25,027 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-28 03:14:25,028 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-28 03:14:25,028 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-28 03:14:25,028 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-28 03:14:25,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 03:14:25,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 03:14:25,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 03:14:25,029 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-28 03:14:25,029 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-28 03:14:25,030 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-28 03:14:25,030 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-28 03:14:25,031 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-28 03:14:25,031 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-28 03:14:25,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {3008#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2980#false} is VALID [2022-04-28 03:14:25,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-28 03:14:25,032 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-28 03:14:25,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:25,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278877752] [2022-04-28 03:14:25,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278877752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:25,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285204153] [2022-04-28 03:14:25,032 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:14:25,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:25,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:25,033 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-28 03:14:25,034 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-28 03:14:25,080 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 03:14:25,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:25,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:14:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:25,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:25,215 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-28 03:14:28,798 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:14:28,799 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-28 03:14:28,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {2979#true} call ULTIMATE.init(); {2979#true} is VALID [2022-04-28 03:14:28,879 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-28 03:14:28,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 03:14:28,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-28 03:14:28,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-28 03:14:28,879 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-28 03:14:28,880 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-28 03:14:28,880 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-28 03:14:28,880 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-28 03:14:28,881 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-28 03:14:28,881 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-28 03:14:28,881 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-28 03:14:28,882 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-28 03:14:28,882 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-28 03:14:28,883 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-28 03:14:28,884 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-28 03:14:28,884 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-28 03:14:28,885 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-28 03:14:28,890 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-28 03:14:28,890 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-28 03:14:28,891 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-28 03:14:28,891 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-28 03:14:28,892 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-28 03:14:28,893 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-28 03:14:28,893 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-28 03:14:28,894 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-28 03:14:28,903 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-28 03:14:28,904 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-28 03:14:28,904 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-28 03:14:28,905 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-28 03:14:28,906 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-28 03:14:28,906 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-28 03:14:28,907 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-28 03:14:28,908 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-28 03:14:28,914 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-28 03:14:28,914 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-28 03:14:28,915 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-28 03:14:28,915 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-28 03:14:28,916 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-28 03:14:28,916 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-28 03:14:28,917 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-28 03:14:28,932 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-28 03:14:28,933 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-28 03:14:28,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {3151#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3155#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:28,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {3155#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2980#false} is VALID [2022-04-28 03:14:28,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-28 03:14:28,934 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-28 03:14:28,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:29,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285204153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:29,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:14:29,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-04-28 03:14:29,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:29,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [967489069] [2022-04-28 03:14:29,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [967489069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:29,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:29,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:14:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977014405] [2022-04-28 03:14:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:29,202 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-28 03:14:29,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:29,203 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-28 03:14:29,228 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-28 03:14:29,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:14:29,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:14:29,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:14:29,229 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-28 03:14:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:30,169 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-04-28 03:14:30,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:14:30,170 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-28 03:14:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:30,170 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-28 03:14:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 03:14:30,171 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-28 03:14:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 03:14:30,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-28 03:14:30,235 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-28 03:14:30,236 INFO L225 Difference]: With dead ends: 62 [2022-04-28 03:14:30,236 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 03:14:30,237 INFO L412 NwaCegarLoop]: 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-28 03:14:30,237 INFO L413 NwaCegarLoop]: 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-28 03:14:30,237 INFO L414 NwaCegarLoop]: 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-28 03:14:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 03:14:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-28 03:14:30,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:30,257 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-28 03:14:30,257 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-28 03:14:30,257 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-28 03:14:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:30,259 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-28 03:14:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-28 03:14:30,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:30,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:30,259 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-28 03:14:30,259 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-28 03:14:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:30,260 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-28 03:14:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-28 03:14:30,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:30,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:30,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:30,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:30,261 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-28 03:14:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-04-28 03:14:30,262 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2022-04-28 03:14:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:30,262 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-04-28 03:14:30,262 INFO L496 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-28 03:14:30,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 58 transitions. [2022-04-28 03:14:30,317 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-28 03:14:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-28 03:14:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 03:14:30,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:30,318 INFO L195 NwaCegarLoop]: 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-28 03:14:30,335 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-28 03:14:30,531 WARN L477 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-28 03:14:30,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:30,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 13 times [2022-04-28 03:14:30,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:30,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [31181274] [2022-04-28 03:14:30,534 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:30,534 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:30,534 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 14 times [2022-04-28 03:14:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:30,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281686311] [2022-04-28 03:14:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,652 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-28 03:14:30,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-28 03:14:30,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 03:14:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:30,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:30,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,663 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-28 03:14:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 03:14:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:30,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:30,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,667 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-28 03:14:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 03:14:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:30,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:30,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,671 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-28 03:14:30,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 03:14:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:30,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:30,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,674 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-28 03:14:30,675 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-28 03:14:30,675 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-28 03:14:30,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-28 03:14:30,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-28 03:14:30,675 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-28 03:14:30,675 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-28 03:14:30,675 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-28 03:14:30,676 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-28 03:14:30,676 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-28 03:14:30,676 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-28 03:14:30,677 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-28 03:14:30,677 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-28 03:14:30,677 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-28 03:14:30,678 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-28 03:14:30,678 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-28 03:14:30,678 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-28 03:14:30,679 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-28 03:14:30,679 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-28 03:14:30,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:30,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:30,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,679 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-28 03:14:30,679 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-28 03:14:30,680 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-28 03:14:30,680 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-28 03:14:30,680 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-28 03:14:30,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:30,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:30,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,681 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-28 03:14:30,681 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-28 03:14:30,681 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-28 03:14:30,682 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-28 03:14:30,682 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-28 03:14:30,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:30,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:30,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,682 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-28 03:14:30,683 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-28 03:14:30,683 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-28 03:14:30,683 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-28 03:14:30,683 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-28 03:14:30,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:30,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:30,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:30,684 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-28 03:14:30,684 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-28 03:14:30,684 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-28 03:14:30,685 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-28 03:14:30,685 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-28 03:14:30,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-28 03:14:30,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-28 03:14:30,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-28 03:14:30,685 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-28 03:14:30,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281686311] [2022-04-28 03:14:30,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281686311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965704710] [2022-04-28 03:14:30,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:14:30,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:30,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:30,686 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-28 03:14:30,688 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-28 03:14:30,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:14:30,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:30,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:14:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:30,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:31,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-28 03:14:31,054 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-28 03:14:31,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-28 03:14:31,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-28 03:14:31,054 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-28 03:14:31,055 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-28 03:14:31,055 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-28 03:14:31,056 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-28 03:14:31,056 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-28 03:14:31,056 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-28 03:14:31,056 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-28 03:14:31,057 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-28 03:14:31,057 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-28 03:14:31,057 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-28 03:14:31,058 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-28 03:14:31,058 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-28 03:14:31,058 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-28 03:14:31,058 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-28 03:14:31,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:31,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:31,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,059 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-28 03:14:31,059 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-28 03:14:31,060 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-28 03:14:31,060 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-28 03:14:31,060 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-28 03:14:31,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:31,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:31,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,061 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-28 03:14:31,061 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-28 03:14:31,061 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-28 03:14:31,062 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-28 03:14:31,062 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-28 03:14:31,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:31,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:31,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,071 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-28 03:14:31,072 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-28 03:14:31,072 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-28 03:14:31,073 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-28 03:14:31,073 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-28 03:14:31,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:31,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:31,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,074 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-28 03:14:31,074 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-28 03:14:31,075 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-28 03:14:31,075 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-28 03:14:31,075 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-28 03:14:31,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-28 03:14:31,075 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-28 03:14:31,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-28 03:14:31,075 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-28 03:14:31,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:31,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-28 03:14:31,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-28 03:14:31,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-28 03:14:31,285 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-28 03:14:31,285 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-28 03:14:31,286 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-28 03:14:31,286 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-28 03:14:31,287 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-28 03:14:31,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:31,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:31,287 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-28 03:14:31,287 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-28 03:14:31,287 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-28 03:14:31,288 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-28 03:14:31,288 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-28 03:14:31,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:31,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:31,288 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-28 03:14:31,289 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-28 03:14:31,289 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-28 03:14:31,289 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-28 03:14:31,290 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-28 03:14:31,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:31,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:31,290 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-28 03:14:31,290 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-28 03:14:31,291 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-28 03:14:31,291 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-28 03:14:31,291 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-28 03:14:31,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 03:14:31,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 03:14:31,291 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-28 03:14:31,292 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-28 03:14:31,292 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-28 03:14:31,292 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-28 03:14:31,293 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-28 03:14:31,293 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-28 03:14:31,293 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-28 03:14:31,294 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-28 03:14:31,294 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-28 03:14:31,294 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-28 03:14:31,294 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-28 03:14:31,295 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-28 03:14:31,295 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-28 03:14:31,295 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-28 03:14:31,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-28 03:14:31,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-28 03:14:31,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 03:14:31,295 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-28 03:14:31,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-28 03:14:31,296 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-28 03:14:31,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965704710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:31,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:31,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-04-28 03:14:31,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:31,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [31181274] [2022-04-28 03:14:31,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [31181274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:31,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:31,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:14:31,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048439299] [2022-04-28 03:14:31,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:31,297 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-28 03:14:31,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:31,298 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-28 03:14:31,337 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-28 03:14:31,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:14:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:31,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:14:31,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:14:31,338 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-28 03:14:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:31,854 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-28 03:14:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:14:31,855 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-28 03:14:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:31,855 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-28 03:14:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 03:14:31,856 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-28 03:14:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 03:14:31,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-28 03:14:31,902 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-28 03:14:31,903 INFO L225 Difference]: With dead ends: 88 [2022-04-28 03:14:31,903 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 03:14:31,904 INFO L412 NwaCegarLoop]: 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-28 03:14:31,904 INFO L413 NwaCegarLoop]: 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-28 03:14:31,904 INFO L414 NwaCegarLoop]: 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-28 03:14:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 03:14:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 03:14:31,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:31,925 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-28 03:14:31,925 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-28 03:14:31,926 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-28 03:14:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:31,927 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-28 03:14:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-28 03:14:31,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:31,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:31,927 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-28 03:14:31,928 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-28 03:14:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:31,935 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-28 03:14:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-28 03:14:31,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:31,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:31,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:31,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:31,935 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-28 03:14:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-28 03:14:31,940 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2022-04-28 03:14:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:31,940 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-28 03:14:31,941 INFO L496 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-28 03:14:31,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-28 03:14:32,032 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-28 03:14:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-28 03:14:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 03:14:32,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:32,033 INFO L195 NwaCegarLoop]: 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-28 03:14:32,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:32,252 WARN L477 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-28 03:14:32,252 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 15 times [2022-04-28 03:14:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:32,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1969511426] [2022-04-28 03:14:32,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:32,254 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:32,254 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 16 times [2022-04-28 03:14:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:32,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049162106] [2022-04-28 03:14:32,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:32,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:32,449 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-28 03:14:32,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-28 03:14:32,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-28 03:14:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:32,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 03:14:32,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 03:14:32,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,462 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-28 03:14:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 03:14:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:32,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 03:14:32,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 03:14:32,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,466 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-28 03:14:32,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 03:14:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:32,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 03:14:32,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 03:14:32,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,471 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-28 03:14:32,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 03:14:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:32,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 03:14:32,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 03:14:32,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,475 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-28 03:14:32,476 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-28 03:14:32,476 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-28 03:14:32,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-28 03:14:32,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-28 03:14:32,476 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-28 03:14:32,476 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-28 03:14:32,476 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-28 03:14:32,477 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-28 03:14:32,477 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-28 03:14:32,478 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-28 03:14:32,478 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-28 03:14:32,478 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-28 03:14:32,479 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-28 03:14:32,479 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-28 03:14:32,480 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-28 03:14:32,480 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-28 03:14:32,481 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-28 03:14:32,481 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-28 03:14:32,481 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-28 03:14:32,481 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-28 03:14:32,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 03:14:32,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 03:14:32,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,482 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-28 03:14:32,482 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-28 03:14:32,483 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-28 03:14:32,483 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-28 03:14:32,483 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-28 03:14:32,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 03:14:32,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 03:14:32,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,484 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-28 03:14:32,484 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-28 03:14:32,484 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-28 03:14:32,485 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-28 03:14:32,485 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-28 03:14:32,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 03:14:32,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 03:14:32,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,485 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-28 03:14:32,486 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-28 03:14:32,486 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-28 03:14:32,487 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-28 03:14:32,487 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-28 03:14:32,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 03:14:32,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 03:14:32,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:32,487 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-28 03:14:32,487 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-28 03:14:32,488 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-28 03:14:32,488 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-28 03:14:32,490 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-28 03:14:32,491 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-28 03:14:32,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {4407#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4373#false} is VALID [2022-04-28 03:14:32,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-28 03:14:32,491 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-28 03:14:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:32,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049162106] [2022-04-28 03:14:32,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049162106] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:32,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697498721] [2022-04-28 03:14:32,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:14:32,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:32,493 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-28 03:14:32,494 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-28 03:14:32,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:14:32,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:32,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:14:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:32,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:32,698 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-28 03:14:36,328 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:14:36,329 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-28 03:14:36,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2022-04-28 03:14:36,395 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-28 03:14:36,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 03:14:36,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-28 03:14:36,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-28 03:14:36,395 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-28 03:14:36,396 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-28 03:14:36,396 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-28 03:14:36,396 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-28 03:14:36,397 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-28 03:14:36,397 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-28 03:14:36,397 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-28 03:14:36,398 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-28 03:14:36,398 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-28 03:14:36,398 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-28 03:14:36,399 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-28 03:14:36,400 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-28 03:14:36,401 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-28 03:14:36,401 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-28 03:14:36,402 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-28 03:14:36,405 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-28 03:14:36,406 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-28 03:14:36,406 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-28 03:14:36,406 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-28 03:14:36,407 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-28 03:14:36,407 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-28 03:14:36,408 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-28 03:14:36,409 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-28 03:14:36,411 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-28 03:14:36,411 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-28 03:14:36,411 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-28 03:14:36,411 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-28 03:14:36,412 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-28 03:14:36,413 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-28 03:14:36,413 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-28 03:14:36,414 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-28 03:14:36,420 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-28 03:14:36,421 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-28 03:14:36,421 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-28 03:14:36,421 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-28 03:14:36,422 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-28 03:14:36,422 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-28 03:14:36,423 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-28 03:14:36,424 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-28 03:14:36,427 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-28 03:14:36,428 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-28 03:14:36,428 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-28 03:14:36,428 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-28 03:14:36,429 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-28 03:14:36,430 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-28 03:14:36,430 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-28 03:14:36,431 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-28 03:14:36,431 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-28 03:14:36,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {4582#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:36,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {4586#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4373#false} is VALID [2022-04-28 03:14:36,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-28 03:14:36,432 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-28 03:14:36,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:36,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697498721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:36,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:14:36,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2022-04-28 03:14:36,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:36,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1969511426] [2022-04-28 03:14:36,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1969511426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:36,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:36,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:14:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244196579] [2022-04-28 03:14:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:36,717 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-28 03:14:36,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:36,717 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-28 03:14:36,747 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-28 03:14:36,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:14:36,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:36,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:14:36,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:14:36,749 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-28 03:14:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:37,994 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-04-28 03:14:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:14:37,994 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-28 03:14:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:37,994 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-28 03:14:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-28 03:14:37,996 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-28 03:14:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-28 03:14:37,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 61 transitions. [2022-04-28 03:14:38,042 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-28 03:14:38,043 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:14:38,043 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 03:14:38,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=2401, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 03:14:38,044 INFO L413 NwaCegarLoop]: 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-28 03:14:38,044 INFO L414 NwaCegarLoop]: 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-28 03:14:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 03:14:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-04-28 03:14:38,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:38,071 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-28 03:14:38,071 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-28 03:14:38,071 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-28 03:14:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:38,072 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-28 03:14:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-28 03:14:38,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:38,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:38,073 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-28 03:14:38,073 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-28 03:14:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:38,074 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-28 03:14:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-28 03:14:38,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:38,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:38,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:38,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:38,074 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-28 03:14:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-28 03:14:38,075 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2022-04-28 03:14:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:38,075 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-28 03:14:38,075 INFO L496 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-28 03:14:38,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-28 03:14:38,148 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-28 03:14:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-28 03:14:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 03:14:38,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:38,149 INFO L195 NwaCegarLoop]: 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-28 03:14:38,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 03:14:38,349 WARN L477 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-28 03:14:38,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:38,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 17 times [2022-04-28 03:14:38,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:38,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979270798] [2022-04-28 03:14:38,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:38,356 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:38,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 18 times [2022-04-28 03:14:38,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:38,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076691210] [2022-04-28 03:14:38,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:38,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:38,478 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-28 03:14:38,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-28 03:14:38,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-28 03:14:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:38,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,483 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-28 03:14:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 03:14:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:38,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,488 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-28 03:14:38,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 03:14:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:38,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,492 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-28 03:14:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 03:14:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:38,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,496 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-28 03:14:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 03:14:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:38,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,500 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-28 03:14:38,500 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-28 03:14:38,500 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-28 03:14:38,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-28 03:14:38,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-28 03:14:38,500 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-28 03:14:38,500 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-28 03:14:38,501 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-28 03:14:38,501 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-28 03:14:38,501 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-28 03:14:38,502 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-28 03:14:38,502 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-28 03:14:38,502 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-28 03:14:38,502 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-28 03:14:38,503 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-28 03:14:38,503 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-28 03:14:38,503 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-28 03:14:38,503 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-28 03:14:38,504 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-28 03:14:38,504 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-28 03:14:38,504 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-28 03:14:38,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,505 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-28 03:14:38,505 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-28 03:14:38,505 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-28 03:14:38,505 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-28 03:14:38,505 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-28 03:14:38,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,506 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-28 03:14:38,506 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-28 03:14:38,507 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-28 03:14:38,507 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-28 03:14:38,507 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-28 03:14:38,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,507 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-28 03:14:38,508 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-28 03:14:38,508 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-28 03:14:38,508 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-28 03:14:38,508 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-28 03:14:38,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,508 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,509 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-28 03:14:38,509 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-28 03:14:38,509 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-28 03:14:38,510 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-28 03:14:38,510 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-28 03:14:38,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,510 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,510 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,510 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-28 03:14:38,510 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-28 03:14:38,511 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-28 03:14:38,511 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-28 03:14:38,511 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-28 03:14:38,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-28 03:14:38,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-28 03:14:38,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-28 03:14:38,512 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-28 03:14:38,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:38,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076691210] [2022-04-28 03:14:38,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076691210] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:38,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477209858] [2022-04-28 03:14:38,512 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:14:38,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:38,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:38,513 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-28 03:14:38,518 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-28 03:14:38,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 03:14:38,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:38,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:14:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:38,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:38,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-28 03:14:38,949 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-28 03:14:38,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-28 03:14:38,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-28 03:14:38,949 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-28 03:14:38,949 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-28 03:14:38,950 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-28 03:14:38,950 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-28 03:14:38,950 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-28 03:14:38,951 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-28 03:14:38,951 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-28 03:14:38,951 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-28 03:14:38,951 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-28 03:14:38,952 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-28 03:14:38,952 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-28 03:14:38,952 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-28 03:14:38,953 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-28 03:14:38,953 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-28 03:14:38,953 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-28 03:14:38,953 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-28 03:14:38,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,954 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-28 03:14:38,954 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-28 03:14:38,955 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-28 03:14:38,955 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-28 03:14:38,955 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-28 03:14:38,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,956 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-28 03:14:38,956 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-28 03:14:38,956 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-28 03:14:38,957 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-28 03:14:38,957 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-28 03:14:38,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,957 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-28 03:14:38,958 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-28 03:14:38,958 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-28 03:14:38,958 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-28 03:14:38,959 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-28 03:14:38,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,959 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-28 03:14:38,959 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-28 03:14:38,960 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-28 03:14:38,960 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-28 03:14:38,960 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-28 03:14:38,960 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:38,960 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:38,960 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:38,961 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-28 03:14:38,961 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-28 03:14:38,961 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-28 03:14:38,962 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-28 03:14:38,962 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-28 03:14:38,962 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-28 03:14:38,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-28 03:14:38,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-28 03:14:38,962 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-28 03:14:38,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:39,312 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-28 03:14:39,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-28 03:14:39,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-28 03:14:39,312 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-28 03:14:39,313 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-28 03:14:39,313 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-28 03:14:39,313 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-28 03:14:39,314 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-28 03:14:39,314 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:39,314 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:39,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:39,314 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-28 03:14:39,314 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-28 03:14:39,314 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-28 03:14:39,315 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-28 03:14:39,315 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-28 03:14:39,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:39,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:39,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:39,315 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-28 03:14:39,316 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-28 03:14:39,316 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-28 03:14:39,316 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-28 03:14:39,317 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-28 03:14:39,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:39,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:39,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:39,317 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-28 03:14:39,317 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-28 03:14:39,317 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-28 03:14:39,318 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-28 03:14:39,318 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-28 03:14:39,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:39,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:39,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:39,318 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-28 03:14:39,318 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-28 03:14:39,319 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-28 03:14:39,319 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-28 03:14:39,319 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-28 03:14:39,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:39,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 03:14:39,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 03:14:39,320 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-28 03:14:39,320 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-28 03:14:39,320 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-28 03:14:39,320 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-28 03:14:39,321 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-28 03:14:39,321 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-28 03:14:39,321 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-28 03:14:39,322 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-28 03:14:39,322 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-28 03:14:39,322 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-28 03:14:39,322 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-28 03:14:39,323 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-28 03:14:39,323 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-28 03:14:39,323 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-28 03:14:39,324 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-28 03:14:39,324 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-28 03:14:39,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-28 03:14:39,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-28 03:14:39,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 03:14:39,324 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-28 03:14:39,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-28 03:14:39,324 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-28 03:14:39,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477209858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:39,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:39,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-04-28 03:14:39,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:39,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [979270798] [2022-04-28 03:14:39,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [979270798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:39,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:39,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:14:39,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581023037] [2022-04-28 03:14:39,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:39,326 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-28 03:14:39,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:39,326 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-28 03:14:39,353 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-28 03:14:39,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:14:39,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:39,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:14:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:14:39,354 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-28 03:14:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:39,884 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-28 03:14:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:14:39,884 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-28 03:14:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:39,884 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-28 03:14:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-28 03:14:39,885 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-28 03:14:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-28 03:14:39,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-28 03:14:39,941 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-28 03:14:39,942 INFO L225 Difference]: With dead ends: 102 [2022-04-28 03:14:39,942 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 03:14:39,943 INFO L412 NwaCegarLoop]: 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-28 03:14:39,943 INFO L413 NwaCegarLoop]: 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-28 03:14:39,943 INFO L414 NwaCegarLoop]: 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-28 03:14:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 03:14:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-28 03:14:39,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:39,967 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-28 03:14:39,967 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-28 03:14:39,967 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-28 03:14:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:39,968 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-28 03:14:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-28 03:14:39,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:39,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:39,969 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-28 03:14:39,969 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-28 03:14:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:39,970 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-28 03:14:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-28 03:14:39,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:39,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:39,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:39,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:39,970 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-28 03:14:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-28 03:14:39,971 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2022-04-28 03:14:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:39,971 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-28 03:14:39,971 INFO L496 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-28 03:14:39,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-28 03:14:40,046 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-28 03:14:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 03:14:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 03:14:40,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:40,047 INFO L195 NwaCegarLoop]: 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-28 03:14:40,063 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-28 03:14:40,247 WARN L477 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-28 03:14:40,247 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:40,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 19 times [2022-04-28 03:14:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:40,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898606871] [2022-04-28 03:14:40,249 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:40,249 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:40,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:40,249 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 20 times [2022-04-28 03:14:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:40,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74727998] [2022-04-28 03:14:40,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:40,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:40,457 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-28 03:14:40,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-28 03:14:40,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 03:14:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:40,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,467 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-28 03:14:40,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 03:14:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:40,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,475 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-28 03:14:40,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:14:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:40,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,480 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-28 03:14:40,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 03:14:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:40,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,484 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-28 03:14:40,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 03:14:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:40,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,488 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-28 03:14:40,489 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-28 03:14:40,489 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-28 03:14:40,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-28 03:14:40,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-28 03:14:40,489 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-28 03:14:40,489 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-28 03:14:40,490 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-28 03:14:40,490 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-28 03:14:40,490 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-28 03:14:40,491 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-28 03:14:40,491 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-28 03:14:40,491 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-28 03:14:40,492 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-28 03:14:40,492 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-28 03:14:40,492 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-28 03:14:40,493 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-28 03:14:40,493 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-28 03:14:40,494 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-28 03:14:40,494 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-28 03:14:40,494 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-28 03:14:40,495 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-28 03:14:40,495 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-28 03:14:40,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,495 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-28 03:14:40,496 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-28 03:14:40,496 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-28 03:14:40,496 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-28 03:14:40,496 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-28 03:14:40,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,497 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-28 03:14:40,497 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-28 03:14:40,498 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-28 03:14:40,498 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-28 03:14:40,498 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-28 03:14:40,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,499 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-28 03:14:40,499 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-28 03:14:40,499 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-28 03:14:40,500 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-28 03:14:40,500 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-28 03:14:40,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,500 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-28 03:14:40,501 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-28 03:14:40,501 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-28 03:14:40,501 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-28 03:14:40,501 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-28 03:14:40,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 03:14:40,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 03:14:40,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:40,502 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-28 03:14:40,502 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-28 03:14:40,503 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-28 03:14:40,503 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-28 03:14:40,504 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-28 03:14:40,504 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-28 03:14:40,504 INFO L290 TraceCheckUtils]: 64: Hoare triple {6047#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6007#false} is VALID [2022-04-28 03:14:40,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-28 03:14:40,504 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-28 03:14:40,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:40,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74727998] [2022-04-28 03:14:40,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74727998] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:40,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873708249] [2022-04-28 03:14:40,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:14:40,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:40,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:40,506 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-28 03:14:40,507 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-28 03:14:40,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:14:40,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:40,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:14:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:40,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:40,736 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-28 03:14:45,167 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:14:45,168 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-28 03:14:45,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2022-04-28 03:14:45,244 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-28 03:14:45,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 03:14:45,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-28 03:14:45,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-28 03:14:45,244 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-28 03:14:45,251 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-28 03:14:45,251 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-28 03:14:45,252 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-28 03:14:45,252 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-28 03:14:45,256 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-28 03:14:45,257 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-28 03:14:45,257 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-28 03:14:45,257 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-28 03:14:45,258 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-28 03:14:45,258 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-28 03:14:45,258 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-28 03:14:45,259 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-28 03:14:45,260 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-28 03:14:45,261 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-28 03:14:45,261 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-28 03:14:45,262 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-28 03:14:45,265 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-28 03:14:45,265 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-28 03:14:45,265 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-28 03:14:45,266 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-28 03:14:45,266 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-28 03:14:45,267 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-28 03:14:45,268 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-28 03:14:45,269 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-28 03:14:45,271 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-28 03:14:45,272 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-28 03:14:45,272 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-28 03:14:45,272 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-28 03:14:45,273 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-28 03:14:45,274 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-28 03:14:45,274 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-28 03:14:45,275 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-28 03:14:45,278 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-28 03:14:45,278 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-28 03:14:45,278 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-28 03:14:45,279 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-28 03:14:45,279 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-28 03:14:45,280 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-28 03:14:45,280 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-28 03:14:45,281 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-28 03:14:45,286 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-28 03:14:45,286 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-28 03:14:45,286 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-28 03:14:45,287 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-28 03:14:45,287 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-28 03:14:45,288 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-28 03:14:45,288 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-28 03:14:45,289 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-28 03:14:45,291 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-28 03:14:45,291 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-28 03:14:45,291 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-28 03:14:45,292 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-28 03:14:45,292 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-28 03:14:45,293 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-28 03:14:45,296 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-28 03:14:45,296 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-28 03:14:45,297 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-28 03:14:45,297 INFO L290 TraceCheckUtils]: 63: Hoare triple {6254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:45,297 INFO L290 TraceCheckUtils]: 64: Hoare triple {6258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6007#false} is VALID [2022-04-28 03:14:45,297 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-28 03:14:45,298 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-28 03:14:45,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:45,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873708249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:45,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:14:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2022-04-28 03:14:45,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898606871] [2022-04-28 03:14:45,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898606871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:45,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:14:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536510676] [2022-04-28 03:14:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:45,797 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-28 03:14:45,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:45,797 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-28 03:14:45,829 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-28 03:14:45,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:14:45,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:45,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:14:45,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:14:45,830 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-28 03:14:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:47,420 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-28 03:14:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:14:47,420 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-28 03:14:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:47,421 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-28 03:14:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-28 03:14:47,422 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-28 03:14:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-28 03:14:47,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2022-04-28 03:14:47,489 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-28 03:14:47,490 INFO L225 Difference]: With dead ends: 82 [2022-04-28 03:14:47,490 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 03:14:47,491 INFO L412 NwaCegarLoop]: 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-28 03:14:47,491 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:14:47,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 98 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:14:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 03:14:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-04-28 03:14:47,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:47,519 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-28 03:14:47,520 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-28 03:14:47,520 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-28 03:14:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:47,521 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-28 03:14:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-28 03:14:47,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:47,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:47,522 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-28 03:14:47,522 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-28 03:14:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:47,523 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-28 03:14:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-28 03:14:47,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:47,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:47,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:47,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:47,524 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-28 03:14:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-28 03:14:47,525 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 66 [2022-04-28 03:14:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:47,526 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-28 03:14:47,526 INFO L496 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-28 03:14:47,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-28 03:14:47,622 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-28 03:14:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-28 03:14:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 03:14:47,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:47,623 INFO L195 NwaCegarLoop]: 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-28 03:14:47,640 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-28 03:14:47,834 WARN L477 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-28 03:14:47,834 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 21 times [2022-04-28 03:14:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:47,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89958582] [2022-04-28 03:14:47,836 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:47,836 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:47,836 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 22 times [2022-04-28 03:14:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:47,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033497152] [2022-04-28 03:14:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:47,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:47,993 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-28 03:14:47,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:47,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-28 03:14:47,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 03:14:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:47,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:47,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:47,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:47,997 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-28 03:14:47,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 03:14:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:48,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,005 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-28 03:14:48,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:14:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:48,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,008 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-28 03:14:48,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 03:14:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:48,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,011 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-28 03:14:48,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 03:14:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:48,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,016 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-28 03:14:48,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 03:14:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:48,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,020 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-28 03:14:48,020 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-28 03:14:48,020 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-28 03:14:48,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-28 03:14:48,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-28 03:14:48,021 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-28 03:14:48,021 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-28 03:14:48,021 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-28 03:14:48,021 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-28 03:14:48,022 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-28 03:14:48,022 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-28 03:14:48,022 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-28 03:14:48,023 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-28 03:14:48,023 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-28 03:14:48,023 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-28 03:14:48,023 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-28 03:14:48,024 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-28 03:14:48,024 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-28 03:14:48,024 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-28 03:14:48,024 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-28 03:14:48,025 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-28 03:14:48,025 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-28 03:14:48,025 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-28 03:14:48,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,026 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-28 03:14:48,026 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-28 03:14:48,026 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-28 03:14:48,027 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-28 03:14:48,027 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-28 03:14:48,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,027 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-28 03:14:48,027 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-28 03:14:48,028 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-28 03:14:48,028 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-28 03:14:48,028 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-28 03:14:48,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,029 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-28 03:14:48,029 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-28 03:14:48,029 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-28 03:14:48,030 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-28 03:14:48,030 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-28 03:14:48,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,030 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-28 03:14:48,030 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-28 03:14:48,031 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-28 03:14:48,031 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-28 03:14:48,031 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-28 03:14:48,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,032 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-28 03:14:48,032 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-28 03:14:48,032 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-28 03:14:48,033 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-28 03:14:48,033 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-28 03:14:48,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,033 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,033 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,033 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-28 03:14:48,033 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-28 03:14:48,034 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-28 03:14:48,034 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-28 03:14:48,034 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-28 03:14:48,034 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-28 03:14:48,034 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-28 03:14:48,034 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-28 03:14:48,035 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-28 03:14:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:48,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033497152] [2022-04-28 03:14:48,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033497152] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:48,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862016904] [2022-04-28 03:14:48,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:14:48,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:48,036 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-28 03:14:48,037 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-28 03:14:48,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:14:48,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:48,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:14:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:48,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:48,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-28 03:14:48,580 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-28 03:14:48,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-28 03:14:48,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-28 03:14:48,580 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-28 03:14:48,580 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-28 03:14:48,581 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-28 03:14:48,581 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-28 03:14:48,581 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-28 03:14:48,582 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-28 03:14:48,582 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-28 03:14:48,582 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-28 03:14:48,582 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-28 03:14:48,583 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-28 03:14:48,583 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-28 03:14:48,583 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-28 03:14:48,584 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-28 03:14:48,584 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-28 03:14:48,584 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-28 03:14:48,585 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-28 03:14:48,585 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-28 03:14:48,585 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-28 03:14:48,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,586 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-28 03:14:48,586 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-28 03:14:48,586 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-28 03:14:48,587 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-28 03:14:48,587 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-28 03:14:48,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,587 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-28 03:14:48,588 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-28 03:14:48,588 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-28 03:14:48,588 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-28 03:14:48,588 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-28 03:14:48,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,589 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-28 03:14:48,589 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-28 03:14:48,590 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-28 03:14:48,590 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-28 03:14:48,590 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-28 03:14:48,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,591 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-28 03:14:48,591 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-28 03:14:48,591 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-28 03:14:48,592 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-28 03:14:48,592 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-28 03:14:48,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,592 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-28 03:14:48,592 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-28 03:14:48,593 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-28 03:14:48,593 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-28 03:14:48,593 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-28 03:14:48,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,593 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,594 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-28 03:14:48,594 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-28 03:14:48,594 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-28 03:14:48,595 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-28 03:14:48,595 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-28 03:14:48,595 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-28 03:14:48,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-28 03:14:48,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-28 03:14:48,595 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-28 03:14:48,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:48,934 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-28 03:14:48,934 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-28 03:14:48,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-28 03:14:48,934 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-28 03:14:48,934 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-28 03:14:48,935 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-28 03:14:48,935 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-28 03:14:48,935 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-28 03:14:48,935 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,935 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,935 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,936 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-28 03:14:48,936 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-28 03:14:48,936 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-28 03:14:48,936 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-28 03:14:48,937 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-28 03:14:48,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,937 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-28 03:14:48,937 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-28 03:14:48,938 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-28 03:14:48,938 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-28 03:14:48,938 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-28 03:14:48,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,939 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-28 03:14:48,939 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-28 03:14:48,939 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-28 03:14:48,940 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-28 03:14:48,940 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-28 03:14:48,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,940 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-28 03:14:48,940 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-28 03:14:48,941 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-28 03:14:48,941 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-28 03:14:48,941 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-28 03:14:48,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,942 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-28 03:14:48,942 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-28 03:14:48,942 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-28 03:14:48,943 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-28 03:14:48,943 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-28 03:14:48,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 03:14:48,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 03:14:48,943 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-28 03:14:48,944 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-28 03:14:48,944 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-28 03:14:48,944 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-28 03:14:48,945 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-28 03:14:48,945 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-28 03:14:48,945 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-28 03:14:48,945 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-28 03:14:48,946 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-28 03:14:48,946 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-28 03:14:48,946 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-28 03:14:48,947 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-28 03:14:48,947 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-28 03:14:48,947 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-28 03:14:48,947 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-28 03:14:48,948 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-28 03:14:48,948 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-28 03:14:48,948 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-28 03:14:48,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-28 03:14:48,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-28 03:14:48,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 03:14:48,948 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-28 03:14:48,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-28 03:14:48,951 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-28 03:14:48,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862016904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:14:48,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:14:48,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-04-28 03:14:48,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:48,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89958582] [2022-04-28 03:14:48,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89958582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:48,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:48,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:14:48,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133450940] [2022-04-28 03:14:48,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:48,952 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-28 03:14:48,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:48,953 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-28 03:14:48,986 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-28 03:14:48,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:14:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:14:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:14:48,987 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-28 03:14:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:49,655 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-04-28 03:14:49,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:14:49,656 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-28 03:14:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:49,656 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-28 03:14:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-28 03:14:49,657 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-28 03:14:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-28 03:14:49,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2022-04-28 03:14:49,725 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-28 03:14:49,726 INFO L225 Difference]: With dead ends: 116 [2022-04-28 03:14:49,727 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 03:14:49,727 INFO L412 NwaCegarLoop]: 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-28 03:14:49,728 INFO L413 NwaCegarLoop]: 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-28 03:14:49,728 INFO L414 NwaCegarLoop]: 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-28 03:14:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 03:14:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-28 03:14:49,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:49,757 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-28 03:14:49,758 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-28 03:14:49,758 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-28 03:14:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:49,759 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-28 03:14:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-28 03:14:49,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:49,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:49,759 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-28 03:14:49,759 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-28 03:14:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:49,760 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-28 03:14:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-28 03:14:49,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:49,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:49,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:49,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:49,761 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-28 03:14:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-28 03:14:49,762 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-28 03:14:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:49,762 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-28 03:14:49,762 INFO L496 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-28 03:14:49,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-28 03:14:49,860 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-28 03:14:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-28 03:14:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 03:14:49,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:49,861 INFO L195 NwaCegarLoop]: 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-28 03:14:49,878 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-28 03:14:50,071 WARN L477 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-28 03:14:50,071 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:50,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 23 times [2022-04-28 03:14:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:50,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [548116220] [2022-04-28 03:14:50,074 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:50,074 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:50,074 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 24 times [2022-04-28 03:14:50,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:50,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564799548] [2022-04-28 03:14:50,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:50,348 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-28 03:14:50,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-28 03:14:50,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:14:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:50,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,354 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-28 03:14:50,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 03:14:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:50,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,358 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-28 03:14:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 03:14:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:50,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,364 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-28 03:14:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:14:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:50,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,368 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-28 03:14:50,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 03:14:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:50,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,371 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-28 03:14:50,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 03:14:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:50,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,375 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-28 03:14:50,376 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-28 03:14:50,376 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-28 03:14:50,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-28 03:14:50,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-28 03:14:50,376 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-28 03:14:50,376 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-28 03:14:50,376 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-28 03:14:50,377 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-28 03:14:50,377 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-28 03:14:50,378 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-28 03:14:50,378 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-28 03:14:50,378 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-28 03:14:50,379 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-28 03:14:50,379 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-28 03:14:50,380 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-28 03:14:50,380 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-28 03:14:50,380 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-28 03:14:50,381 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-28 03:14:50,381 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-28 03:14:50,382 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-28 03:14:50,382 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-28 03:14:50,382 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-28 03:14:50,383 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-28 03:14:50,383 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-28 03:14:50,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,384 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-28 03:14:50,384 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-28 03:14:50,384 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-28 03:14:50,385 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-28 03:14:50,385 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-28 03:14:50,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,385 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-28 03:14:50,386 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-28 03:14:50,386 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-28 03:14:50,387 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-28 03:14:50,387 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-28 03:14:50,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,387 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-28 03:14:50,388 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-28 03:14:50,388 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-28 03:14:50,389 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-28 03:14:50,389 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-28 03:14:50,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,389 INFO L290 TraceCheckUtils]: 51: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,389 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-28 03:14:50,390 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-28 03:14:50,390 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-28 03:14:50,391 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-28 03:14:50,391 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-28 03:14:50,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,391 INFO L290 TraceCheckUtils]: 59: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,391 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-28 03:14:50,392 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-28 03:14:50,392 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-28 03:14:50,392 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-28 03:14:50,392 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-28 03:14:50,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 03:14:50,393 INFO L290 TraceCheckUtils]: 66: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 03:14:50,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:50,393 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-28 03:14:50,393 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-28 03:14:50,394 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-28 03:14:50,394 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-28 03:14:50,395 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-28 03:14:50,395 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-28 03:14:50,395 INFO L290 TraceCheckUtils]: 74: Hoare triple {7928#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7882#false} is VALID [2022-04-28 03:14:50,395 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-28 03:14:50,395 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-28 03:14:50,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:50,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564799548] [2022-04-28 03:14:50,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564799548] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:50,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077980326] [2022-04-28 03:14:50,396 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:14:50,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:50,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:50,397 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-28 03:14:50,397 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-28 03:14:50,474 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 03:14:50,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:50,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:14:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:50,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:50,690 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-28 03:14:55,752 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:14:55,752 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-28 03:14:55,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {7881#true} call ULTIMATE.init(); {7881#true} is VALID [2022-04-28 03:14:55,829 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-28 03:14:55,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 03:14:55,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-28 03:14:55,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-28 03:14:55,830 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-28 03:14:55,830 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-28 03:14:55,830 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-28 03:14:55,831 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-28 03:14:55,831 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-28 03:14:55,831 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-28 03:14:55,831 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-28 03:14:55,832 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-28 03:14:55,832 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-28 03:14:55,832 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-28 03:14:55,833 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-28 03:14:55,833 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-28 03:14:55,833 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-28 03:14:55,834 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-28 03:14:55,834 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-28 03:14:55,835 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-28 03:14:55,837 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-28 03:14:55,837 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-28 03:14:55,847 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-28 03:14:55,851 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-28 03:14:55,852 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-28 03:14:55,856 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-28 03:14:55,857 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-28 03:14:55,858 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-28 03:14:55,858 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-28 03:14:55,859 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-28 03:14:55,859 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-28 03:14:55,861 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-28 03:14:55,867 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-28 03:14:55,870 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-28 03:14:55,871 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-28 03:14:55,871 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-28 03:14:55,872 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-28 03:14:55,872 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-28 03:14:55,873 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-28 03:14:55,879 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-28 03:14:55,884 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-28 03:14:55,905 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-28 03:14:55,906 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-28 03:14:55,906 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-28 03:14:55,907 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-28 03:14:55,907 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-28 03:14:55,908 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-28 03:14:55,910 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-28 03:14:55,910 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-28 03:14:55,911 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-28 03:14:55,911 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-28 03:14:55,912 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-28 03:14:55,912 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-28 03:14:55,913 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-28 03:14:55,913 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-28 03:14:55,915 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-28 03:14:55,916 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-28 03:14:55,916 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-28 03:14:55,920 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-28 03:14:55,921 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-28 03:14:55,921 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-28 03:14:55,922 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-28 03:14:55,922 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-28 03:14:55,926 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-28 03:14:55,927 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-28 03:14:55,927 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-28 03:14:55,928 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-28 03:14:55,928 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-28 03:14:55,929 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-28 03:14:55,929 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-28 03:14:55,930 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-28 03:14:55,930 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-28 03:14:55,931 INFO L290 TraceCheckUtils]: 73: Hoare triple {8167#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8171#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:14:55,931 INFO L290 TraceCheckUtils]: 74: Hoare triple {8171#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7882#false} is VALID [2022-04-28 03:14:55,931 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-28 03:14:55,931 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-28 03:14:55,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:14:56,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077980326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:56,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:14:56,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-04-28 03:14:56,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:14:56,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [548116220] [2022-04-28 03:14:56,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [548116220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:56,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:56,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:14:56,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976308562] [2022-04-28 03:14:56,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:14:56,203 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-28 03:14:56,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:14:56,203 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-28 03:14:56,242 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-28 03:14:56,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:14:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:14:56,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1697, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:14:56,243 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-28 03:14:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:58,373 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-28 03:14:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:14:58,373 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-28 03:14:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:14:58,373 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-28 03:14:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 03:14:58,374 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-28 03:14:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 03:14:58,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-28 03:14:58,442 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-28 03:14:58,443 INFO L225 Difference]: With dead ends: 92 [2022-04-28 03:14:58,443 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 03:14:58,444 INFO L412 NwaCegarLoop]: 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-28 03:14:58,444 INFO L413 NwaCegarLoop]: 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-28 03:14:58,444 INFO L414 NwaCegarLoop]: 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-28 03:14:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 03:14:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-04-28 03:14:58,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:14:58,477 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-28 03:14:58,477 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-28 03:14:58,477 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-28 03:14:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:58,479 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 03:14:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-28 03:14:58,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:58,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:58,479 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-28 03:14:58,479 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-28 03:14:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:14:58,480 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 03:14:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-28 03:14:58,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:14:58,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:14:58,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:14:58,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:14:58,482 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-28 03:14:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-28 03:14:58,483 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 76 [2022-04-28 03:14:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:14:58,483 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-28 03:14:58,484 INFO L496 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-28 03:14:58,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-28 03:14:58,590 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-28 03:14:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-28 03:14:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 03:14:58,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:14:58,591 INFO L195 NwaCegarLoop]: 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-28 03:14:58,612 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-28 03:14:58,792 WARN L477 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-28 03:14:58,792 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:14:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:14:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 25 times [2022-04-28 03:14:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:14:58,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852387931] [2022-04-28 03:14:58,794 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:14:58,794 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:14:58,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:14:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 26 times [2022-04-28 03:14:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:14:58,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012522827] [2022-04-28 03:14:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:14:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:14:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:14:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:58,978 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-28 03:14:58,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:58,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-28 03:14:58,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 03:14:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:58,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:58,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:58,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:58,984 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-28 03:14:58,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 03:14:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:58,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:58,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:58,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:58,989 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-28 03:14:58,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 03:14:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:58,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:58,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:58,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:58,993 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-28 03:14:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:14:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:59,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,009 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-28 03:14:59,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 03:14:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:59,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,013 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-28 03:14:59,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 03:14:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:59,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,017 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-28 03:14:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:14:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:59,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,021 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-28 03:14:59,021 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-28 03:14:59,021 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-28 03:14:59,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-28 03:14:59,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-28 03:14:59,022 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-28 03:14:59,022 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-28 03:14:59,022 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-28 03:14:59,022 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-28 03:14:59,023 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-28 03:14:59,023 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-28 03:14:59,023 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-28 03:14:59,024 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-28 03:14:59,024 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-28 03:14:59,024 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-28 03:14:59,025 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-28 03:14:59,025 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-28 03:14:59,025 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-28 03:14:59,026 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-28 03:14:59,026 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-28 03:14:59,026 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-28 03:14:59,027 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-28 03:14:59,027 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-28 03:14:59,027 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-28 03:14:59,027 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-28 03:14:59,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,028 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-28 03:14:59,028 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-28 03:14:59,029 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-28 03:14:59,029 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-28 03:14:59,029 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-28 03:14:59,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,030 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-28 03:14:59,030 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-28 03:14:59,030 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-28 03:14:59,031 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-28 03:14:59,031 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-28 03:14:59,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,031 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-28 03:14:59,032 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-28 03:14:59,032 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-28 03:14:59,032 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-28 03:14:59,032 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-28 03:14:59,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,033 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-28 03:14:59,033 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-28 03:14:59,033 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-28 03:14:59,034 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-28 03:14:59,034 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-28 03:14:59,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,034 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,034 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-28 03:14:59,035 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-28 03:14:59,035 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-28 03:14:59,035 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-28 03:14:59,036 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-28 03:14:59,036 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,036 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,036 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,036 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-28 03:14:59,036 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-28 03:14:59,037 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-28 03:14:59,037 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-28 03:14:59,037 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-28 03:14:59,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,038 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-28 03:14:59,038 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-28 03:14:59,038 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-28 03:14:59,039 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-28 03:14:59,039 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-28 03:14:59,039 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-28 03:14:59,039 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-28 03:14:59,039 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-28 03:14:59,039 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-28 03:14:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:59,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012522827] [2022-04-28 03:14:59,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012522827] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:14:59,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919214576] [2022-04-28 03:14:59,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:14:59,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:14:59,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:14:59,040 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-28 03:14:59,041 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-28 03:14:59,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:14:59,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:14:59,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:14:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:14:59,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:59,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-28 03:14:59,662 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-28 03:14:59,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-28 03:14:59,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-28 03:14:59,663 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-28 03:14:59,663 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-28 03:14:59,663 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-28 03:14:59,664 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-28 03:14:59,664 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-28 03:14:59,664 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-28 03:14:59,664 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-28 03:14:59,665 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-28 03:14:59,665 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-28 03:14:59,665 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-28 03:14:59,666 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-28 03:14:59,666 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-28 03:14:59,666 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-28 03:14:59,667 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-28 03:14:59,667 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-28 03:14:59,667 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-28 03:14:59,668 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-28 03:14:59,668 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-28 03:14:59,668 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-28 03:14:59,668 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-28 03:14:59,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,669 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-28 03:14:59,671 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-28 03:14:59,671 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-28 03:14:59,671 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-28 03:14:59,672 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-28 03:14:59,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,672 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-28 03:14:59,672 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-28 03:14:59,673 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-28 03:14:59,673 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-28 03:14:59,673 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-28 03:14:59,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,674 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-28 03:14:59,674 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-28 03:14:59,675 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-28 03:14:59,675 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-28 03:14:59,675 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-28 03:14:59,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,676 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-28 03:14:59,676 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-28 03:14:59,676 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-28 03:14:59,677 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-28 03:14:59,677 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-28 03:14:59,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,677 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-28 03:14:59,678 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-28 03:14:59,678 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-28 03:14:59,678 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-28 03:14:59,678 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-28 03:14:59,678 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,678 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,679 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,679 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-28 03:14:59,679 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-28 03:14:59,680 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-28 03:14:59,680 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-28 03:14:59,680 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-28 03:14:59,680 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:14:59,680 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:14:59,680 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:14:59,681 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-28 03:14:59,681 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-28 03:14:59,681 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-28 03:14:59,682 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-28 03:14:59,682 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-28 03:14:59,682 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-28 03:14:59,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-28 03:14:59,682 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-28 03:14:59,682 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-28 03:14:59,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:00,014 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-28 03:15:00,014 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-28 03:15:00,014 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-28 03:15:00,014 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-28 03:15:00,015 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-28 03:15:00,015 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-28 03:15:00,015 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-28 03:15:00,016 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-28 03:15:00,016 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:15:00,016 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:15:00,016 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:15:00,016 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-28 03:15:00,016 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-28 03:15:00,017 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-28 03:15:00,017 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-28 03:15:00,017 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-28 03:15:00,017 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:15:00,017 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:15:00,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:15:00,017 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-28 03:15:00,018 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-28 03:15:00,018 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-28 03:15:00,018 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-28 03:15:00,019 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-28 03:15:00,019 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:15:00,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:15:00,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:15:00,019 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-28 03:15:00,019 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-28 03:15:00,020 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-28 03:15:00,020 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-28 03:15:00,020 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-28 03:15:00,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:15:00,021 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:15:00,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:15:00,021 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-28 03:15:00,021 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-28 03:15:00,021 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-28 03:15:00,022 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-28 03:15:00,022 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-28 03:15:00,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:15:00,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:15:00,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:15:00,022 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-28 03:15:00,022 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-28 03:15:00,023 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-28 03:15:00,023 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-28 03:15:00,023 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-28 03:15:00,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:15:00,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:15:00,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:15:00,024 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-28 03:15:00,024 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-28 03:15:00,024 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-28 03:15:00,025 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-28 03:15:00,025 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-28 03:15:00,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:15:00,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 03:15:00,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 03:15:00,025 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-28 03:15:00,025 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-28 03:15:00,026 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-28 03:15:00,026 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-28 03:15:00,026 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-28 03:15:00,027 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-28 03:15:00,027 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-28 03:15:00,027 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-28 03:15:00,028 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-28 03:15:00,028 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-28 03:15:00,028 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-28 03:15:00,029 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-28 03:15:00,029 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-28 03:15:00,029 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-28 03:15:00,029 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-28 03:15:00,030 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-28 03:15:00,030 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-28 03:15:00,030 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-28 03:15:00,031 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-28 03:15:00,031 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-28 03:15:00,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-28 03:15:00,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-28 03:15:00,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 03:15:00,031 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-28 03:15:00,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-28 03:15:00,031 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-28 03:15:00,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919214576] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:00,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:00,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 30 [2022-04-28 03:15:00,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:00,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852387931] [2022-04-28 03:15:00,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852387931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:00,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:00,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:15:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737441932] [2022-04-28 03:15:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:00,032 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-28 03:15:00,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:00,033 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-28 03:15:00,071 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-28 03:15:00,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:15:00,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:15:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:15:00,072 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-28 03:15:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:00,778 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-04-28 03:15:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:15:00,778 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-28 03:15:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:00,778 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-28 03:15:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-28 03:15:00,780 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-28 03:15:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-28 03:15:00,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-28 03:15:00,847 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-28 03:15:00,849 INFO L225 Difference]: With dead ends: 130 [2022-04-28 03:15:00,849 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 03:15:00,851 INFO L412 NwaCegarLoop]: 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-28 03:15:00,853 INFO L413 NwaCegarLoop]: 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-28 03:15:00,854 INFO L414 NwaCegarLoop]: 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-28 03:15:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 03:15:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-28 03:15:00,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:00,889 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-28 03:15:00,889 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-28 03:15:00,890 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-28 03:15:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:00,891 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 03:15:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-28 03:15:00,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:00,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:00,891 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-28 03:15:00,891 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-28 03:15:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:00,893 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 03:15:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-28 03:15:00,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:00,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:00,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:00,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:00,893 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-28 03:15:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-04-28 03:15:00,894 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2022-04-28 03:15:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:00,894 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-04-28 03:15:00,895 INFO L496 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-28 03:15:00,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 90 transitions. [2022-04-28 03:15:01,003 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-28 03:15:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-28 03:15:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 03:15:01,004 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:01,004 INFO L195 NwaCegarLoop]: 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-28 03:15:01,021 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-28 03:15:01,215 WARN L477 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-28 03:15:01,215 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:01,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 27 times [2022-04-28 03:15:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:01,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [343821379] [2022-04-28 03:15:01,217 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:15:01,218 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:15:01,218 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:15:01,218 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 28 times [2022-04-28 03:15:01,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:01,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99701197] [2022-04-28 03:15:01,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:01,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,537 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-28 03:15:01,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-28 03:15:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 03:15:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,540 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-28 03:15:01,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 03:15:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,545 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-28 03:15:01,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 03:15:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,548 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-28 03:15:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 03:15:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,552 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-28 03:15:01,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 03:15:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,557 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-28 03:15:01,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-28 03:15:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,561 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-28 03:15:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-28 03:15:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,564 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-28 03:15:01,564 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-28 03:15:01,564 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-28 03:15:01,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-28 03:15:01,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-28 03:15:01,565 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-28 03:15:01,565 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-28 03:15:01,565 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-28 03:15:01,565 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-28 03:15:01,566 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-28 03:15:01,566 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-28 03:15:01,566 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-28 03:15:01,567 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-28 03:15:01,567 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-28 03:15:01,568 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-28 03:15:01,568 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-28 03:15:01,568 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-28 03:15:01,569 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-28 03:15:01,569 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-28 03:15:01,569 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-28 03:15:01,570 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-28 03:15:01,570 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-28 03:15:01,571 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-28 03:15:01,571 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-28 03:15:01,571 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-28 03:15:01,572 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-28 03:15:01,572 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-28 03:15:01,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,572 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-28 03:15:01,573 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-28 03:15:01,573 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-28 03:15:01,573 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-28 03:15:01,573 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-28 03:15:01,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,574 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-28 03:15:01,574 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-28 03:15:01,575 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-28 03:15:01,575 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-28 03:15:01,575 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-28 03:15:01,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,576 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-28 03:15:01,576 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-28 03:15:01,577 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-28 03:15:01,577 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-28 03:15:01,577 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-28 03:15:01,577 INFO L290 TraceCheckUtils]: 51: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,578 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-28 03:15:01,578 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-28 03:15:01,579 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-28 03:15:01,579 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-28 03:15:01,579 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-28 03:15:01,579 INFO L290 TraceCheckUtils]: 59: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,579 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,579 INFO L290 TraceCheckUtils]: 61: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,580 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-28 03:15:01,580 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-28 03:15:01,580 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-28 03:15:01,581 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-28 03:15:01,581 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-28 03:15:01,581 INFO L290 TraceCheckUtils]: 67: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,581 INFO L290 TraceCheckUtils]: 68: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,581 INFO L290 TraceCheckUtils]: 69: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,581 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-28 03:15:01,582 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-28 03:15:01,582 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-28 03:15:01,582 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-28 03:15:01,583 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-28 03:15:01,583 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 03:15:01,583 INFO L290 TraceCheckUtils]: 76: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 03:15:01,583 INFO L290 TraceCheckUtils]: 77: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:01,583 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-28 03:15:01,584 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-28 03:15:01,584 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-28 03:15:01,584 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-28 03:15:01,585 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-28 03:15:01,585 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-28 03:15:01,585 INFO L290 TraceCheckUtils]: 84: Hoare triple {10050#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9998#false} is VALID [2022-04-28 03:15:01,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-28 03:15:01,586 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-28 03:15:01,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:01,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99701197] [2022-04-28 03:15:01,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99701197] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:01,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169113087] [2022-04-28 03:15:01,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:15:01,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:01,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:01,587 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-28 03:15:01,588 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-28 03:15:01,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:15:01,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:15:01,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:15:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:01,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:01,945 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-28 03:15:08,226 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:15:08,227 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-28 03:15:08,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {9997#true} is VALID [2022-04-28 03:15:08,311 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-28 03:15:08,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 03:15:08,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-28 03:15:08,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-28 03:15:08,311 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-28 03:15:08,311 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-28 03:15:08,312 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-28 03:15:08,312 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-28 03:15:08,312 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-28 03:15:08,313 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-28 03:15:08,313 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-28 03:15:08,313 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-28 03:15:08,313 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-28 03:15:08,314 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-28 03:15:08,314 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-28 03:15:08,314 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-28 03:15:08,315 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-28 03:15:08,315 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-28 03:15:08,315 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-28 03:15:08,316 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-28 03:15:08,316 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-28 03:15:08,317 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-28 03:15:08,318 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-28 03:15:08,318 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-28 03:15:08,319 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-28 03:15:08,320 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-28 03:15:08,320 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-28 03:15:08,321 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-28 03:15:08,321 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-28 03:15:08,321 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-28 03:15:08,322 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-28 03:15:08,323 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-28 03:15:08,323 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-28 03:15:08,324 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-28 03:15:08,324 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-28 03:15:08,325 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-28 03:15:08,325 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-28 03:15:08,326 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-28 03:15:08,326 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-28 03:15:08,327 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-28 03:15:08,327 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-28 03:15:08,328 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-28 03:15:08,329 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-28 03:15:08,329 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-28 03:15:08,329 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-28 03:15:08,330 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-28 03:15:08,330 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-28 03:15:08,331 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-28 03:15:08,332 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-28 03:15:08,333 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-28 03:15:08,333 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-28 03:15:08,333 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-28 03:15:08,334 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-28 03:15:08,334 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-28 03:15:08,335 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-28 03:15:08,335 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-28 03:15:08,336 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-28 03:15:08,337 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-28 03:15:08,337 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-28 03:15:08,337 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-28 03:15:08,338 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-28 03:15:08,338 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-28 03:15:08,339 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-28 03:15:08,339 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-28 03:15:08,340 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-28 03:15:08,341 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-28 03:15:08,341 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-28 03:15:08,342 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-28 03:15:08,342 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-28 03:15:08,343 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-28 03:15:08,343 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-28 03:15:08,344 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-28 03:15:08,344 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-28 03:15:08,345 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-28 03:15:08,346 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-28 03:15:08,347 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-28 03:15:08,347 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-28 03:15:08,348 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-28 03:15:08,348 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-28 03:15:08,349 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-28 03:15:08,349 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-28 03:15:08,350 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-28 03:15:08,350 INFO L290 TraceCheckUtils]: 83: Hoare triple {10321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:08,350 INFO L290 TraceCheckUtils]: 84: Hoare triple {10325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9998#false} is VALID [2022-04-28 03:15:08,350 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-28 03:15:08,351 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-28 03:15:08,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:08,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169113087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:08,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:15:08,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2022-04-28 03:15:08,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:08,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [343821379] [2022-04-28 03:15:08,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [343821379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:08,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:08,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:15:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978485463] [2022-04-28 03:15:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:08,819 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-28 03:15:08,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:08,820 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-28 03:15:08,864 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-28 03:15:08,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:15:08,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:15:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 03:15:08,866 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-28 03:15:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:11,509 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-04-28 03:15:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:15:11,510 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-28 03:15:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:11,510 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-28 03:15:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-28 03:15:11,511 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-28 03:15:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-28 03:15:11,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 82 transitions. [2022-04-28 03:15:11,581 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-28 03:15:11,583 INFO L225 Difference]: With dead ends: 102 [2022-04-28 03:15:11,583 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 03:15:11,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=395, Invalid=4435, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 03:15:11,584 INFO L413 NwaCegarLoop]: 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-28 03:15:11,584 INFO L414 NwaCegarLoop]: 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-28 03:15:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 03:15:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-04-28 03:15:11,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:11,628 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-28 03:15:11,628 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-28 03:15:11,628 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-28 03:15:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:11,629 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 03:15:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 03:15:11,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:11,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:11,630 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-28 03:15:11,630 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-28 03:15:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:11,631 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 03:15:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 03:15:11,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:11,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:11,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:11,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:11,632 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-28 03:15:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-04-28 03:15:11,633 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2022-04-28 03:15:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:11,633 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-04-28 03:15:11,633 INFO L496 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-28 03:15:11,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 98 transitions. [2022-04-28 03:15:11,754 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-28 03:15:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-28 03:15:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 03:15:11,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:11,755 INFO L195 NwaCegarLoop]: 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-28 03:15:11,772 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-28 03:15:11,971 WARN L477 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-28 03:15:11,971 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:11,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 29 times [2022-04-28 03:15:11,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:11,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050449252] [2022-04-28 03:15:11,974 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:15:11,974 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:15:11,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:15:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 30 times [2022-04-28 03:15:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:11,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834412159] [2022-04-28 03:15:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:11,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,164 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-28 03:15:12,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-28 03:15:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 03:15:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,168 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-28 03:15:12,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 03:15:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,171 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-28 03:15:12,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 03:15:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,174 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-28 03:15:12,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 03:15:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,181 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-28 03:15:12,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 03:15:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,185 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-28 03:15:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-28 03:15:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,189 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-28 03:15:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-28 03:15:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,192 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-28 03:15:12,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:15:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,204 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-28 03:15:12,204 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-28 03:15:12,204 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-28 03:15:12,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-28 03:15:12,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-28 03:15:12,205 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-28 03:15:12,205 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-28 03:15:12,205 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-28 03:15:12,205 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-28 03:15:12,206 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-28 03:15:12,206 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-28 03:15:12,206 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-28 03:15:12,207 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-28 03:15:12,207 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-28 03:15:12,207 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-28 03:15:12,207 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-28 03:15:12,208 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-28 03:15:12,208 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-28 03:15:12,208 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-28 03:15:12,208 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-28 03:15:12,209 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-28 03:15:12,209 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-28 03:15:12,209 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-28 03:15:12,210 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-28 03:15:12,210 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-28 03:15:12,210 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-28 03:15:12,210 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-28 03:15:12,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,211 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-28 03:15:12,211 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-28 03:15:12,212 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-28 03:15:12,212 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-28 03:15:12,212 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-28 03:15:12,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,212 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-28 03:15:12,213 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-28 03:15:12,213 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-28 03:15:12,213 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-28 03:15:12,213 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-28 03:15:12,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,214 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-28 03:15:12,214 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-28 03:15:12,215 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-28 03:15:12,215 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-28 03:15:12,215 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-28 03:15:12,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,215 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-28 03:15:12,216 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-28 03:15:12,216 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-28 03:15:12,216 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-28 03:15:12,216 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-28 03:15:12,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,217 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-28 03:15:12,217 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-28 03:15:12,218 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-28 03:15:12,218 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-28 03:15:12,218 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-28 03:15:12,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,218 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,218 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,218 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-28 03:15:12,219 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-28 03:15:12,219 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-28 03:15:12,219 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-28 03:15:12,219 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-28 03:15:12,220 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,220 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,220 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,220 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-28 03:15:12,220 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-28 03:15:12,221 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-28 03:15:12,221 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-28 03:15:12,221 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-28 03:15:12,221 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,221 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,221 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,222 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-28 03:15:12,222 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-28 03:15:12,222 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-28 03:15:12,222 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-28 03:15:12,223 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-28 03:15:12,223 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-28 03:15:12,223 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-28 03:15:12,223 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-28 03:15:12,223 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-28 03:15:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:12,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834412159] [2022-04-28 03:15:12,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834412159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:12,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65195600] [2022-04-28 03:15:12,223 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:15:12,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:12,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:12,224 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-28 03:15:12,225 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-28 03:15:12,301 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 03:15:12,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:15:12,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:15:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:12,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:12,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-28 03:15:12,920 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-28 03:15:12,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-28 03:15:12,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-28 03:15:12,921 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-28 03:15:12,921 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-28 03:15:12,921 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-28 03:15:12,922 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-28 03:15:12,922 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-28 03:15:12,922 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-28 03:15:12,923 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-28 03:15:12,923 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-28 03:15:12,923 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-28 03:15:12,924 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-28 03:15:12,924 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-28 03:15:12,924 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-28 03:15:12,924 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-28 03:15:12,925 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-28 03:15:12,925 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-28 03:15:12,925 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-28 03:15:12,926 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-28 03:15:12,926 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-28 03:15:12,926 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-28 03:15:12,927 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-28 03:15:12,927 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-28 03:15:12,927 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-28 03:15:12,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,928 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-28 03:15:12,928 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-28 03:15:12,928 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-28 03:15:12,929 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-28 03:15:12,929 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-28 03:15:12,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,929 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-28 03:15:12,930 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-28 03:15:12,930 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-28 03:15:12,930 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-28 03:15:12,930 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-28 03:15:12,930 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,931 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-28 03:15:12,931 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-28 03:15:12,932 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-28 03:15:12,932 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-28 03:15:12,932 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-28 03:15:12,932 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,932 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,932 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,933 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-28 03:15:12,933 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-28 03:15:12,933 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-28 03:15:12,934 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-28 03:15:12,934 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-28 03:15:12,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,935 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-28 03:15:12,935 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-28 03:15:12,936 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-28 03:15:12,936 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-28 03:15:12,936 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-28 03:15:12,936 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,936 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,936 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,937 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-28 03:15:12,937 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-28 03:15:12,937 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-28 03:15:12,938 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-28 03:15:12,938 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-28 03:15:12,938 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,938 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,938 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-28 03:15:12,939 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-28 03:15:12,939 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-28 03:15:12,939 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-28 03:15:12,939 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-28 03:15:12,939 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:12,939 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:12,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:12,940 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-28 03:15:12,940 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-28 03:15:12,941 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-28 03:15:12,941 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-28 03:15:12,941 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-28 03:15:12,941 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-28 03:15:12,941 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-28 03:15:12,941 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-28 03:15:12,942 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-28 03:15:12,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:15:13,340 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-28 03:15:13,341 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-28 03:15:13,341 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-28 03:15:13,341 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-28 03:15:13,341 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-28 03:15:13,342 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-28 03:15:13,342 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-28 03:15:13,342 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-28 03:15:13,342 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:13,342 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:13,342 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:13,342 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-28 03:15:13,343 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-28 03:15:13,343 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-28 03:15:13,343 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-28 03:15:13,344 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-28 03:15:13,344 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:13,344 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:13,344 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:13,344 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-28 03:15:13,344 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-28 03:15:13,345 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-28 03:15:13,345 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-28 03:15:13,345 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-28 03:15:13,345 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:13,346 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:13,346 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:13,346 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-28 03:15:13,346 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-28 03:15:13,346 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-28 03:15:13,347 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-28 03:15:13,347 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-28 03:15:13,347 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:13,347 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:13,347 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:13,347 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-28 03:15:13,347 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-28 03:15:13,348 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-28 03:15:13,348 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-28 03:15:13,348 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-28 03:15:13,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:13,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:13,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:13,349 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-28 03:15:13,349 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-28 03:15:13,349 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-28 03:15:13,350 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-28 03:15:13,350 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-28 03:15:13,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:13,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:13,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:13,350 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-28 03:15:13,350 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-28 03:15:13,351 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-28 03:15:13,351 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-28 03:15:13,351 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-28 03:15:13,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:13,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:13,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:13,352 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-28 03:15:13,352 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-28 03:15:13,352 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-28 03:15:13,353 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-28 03:15:13,353 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-28 03:15:13,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:13,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 03:15:13,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 03:15:13,353 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-28 03:15:13,353 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-28 03:15:13,354 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-28 03:15:13,354 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-28 03:15:13,354 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-28 03:15:13,355 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-28 03:15:13,355 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-28 03:15:13,355 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-28 03:15:13,356 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-28 03:15:13,356 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-28 03:15:13,356 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-28 03:15:13,356 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-28 03:15:13,357 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-28 03:15:13,357 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-28 03:15:13,357 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-28 03:15:13,358 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-28 03:15:13,358 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-28 03:15:13,358 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-28 03:15:13,358 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-28 03:15:13,359 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-28 03:15:13,359 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-28 03:15:13,359 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-28 03:15:13,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-28 03:15:13,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-28 03:15:13,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 03:15:13,359 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-28 03:15:13,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-28 03:15:13,360 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-28 03:15:13,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65195600] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:15:13,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:15:13,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 33 [2022-04-28 03:15:13,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:13,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050449252] [2022-04-28 03:15:13,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050449252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:13,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:13,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:15:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487576868] [2022-04-28 03:15:13,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:13,361 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-28 03:15:13,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:13,361 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-28 03:15:13,404 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-28 03:15:13,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:15:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:13,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:15:13,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:15:13,405 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-28 03:15:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:14,220 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2022-04-28 03:15:14,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:15:14,220 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-28 03:15:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:14,221 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-28 03:15:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-28 03:15:14,222 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-28 03:15:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-28 03:15:14,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2022-04-28 03:15:14,286 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-28 03:15:14,287 INFO L225 Difference]: With dead ends: 144 [2022-04-28 03:15:14,287 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 03:15:14,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=490, Invalid=2162, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 03:15:14,288 INFO L413 NwaCegarLoop]: 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-28 03:15:14,289 INFO L414 NwaCegarLoop]: 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-28 03:15:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 03:15:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-04-28 03:15:14,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:14,335 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-28 03:15:14,335 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-28 03:15:14,335 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-28 03:15:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:14,337 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 03:15:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 03:15:14,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:14,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:14,337 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-28 03:15:14,337 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-28 03:15:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:14,339 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 03:15:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 03:15:14,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:14,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:14,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:14,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:14,339 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-28 03:15:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-28 03:15:14,340 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-04-28 03:15:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:14,340 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-28 03:15:14,341 INFO L496 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-28 03:15:14,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-28 03:15:14,469 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-28 03:15:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-28 03:15:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 03:15:14,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:14,469 INFO L195 NwaCegarLoop]: 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-28 03:15:14,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 03:15:14,683 WARN L477 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-28 03:15:14,683 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:14,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 31 times [2022-04-28 03:15:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:14,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1259505499] [2022-04-28 03:15:14,686 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:15:14,686 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:15:14,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:15:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 32 times [2022-04-28 03:15:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:14,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774594396] [2022-04-28 03:15:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:14,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,017 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-28 03:15:15,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-28 03:15:15,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 03:15:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,021 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-28 03:15:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 03:15:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,024 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-28 03:15:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 03:15:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,027 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-28 03:15:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 03:15:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,030 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-28 03:15:15,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:15:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,046 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-28 03:15:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 03:15:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,051 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-28 03:15:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 03:15:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,054 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-28 03:15:15,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-28 03:15:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,058 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-28 03:15:15,059 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-28 03:15:15,059 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-28 03:15:15,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-28 03:15:15,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-28 03:15:15,059 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-28 03:15:15,059 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-28 03:15:15,059 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-28 03:15:15,060 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-28 03:15:15,060 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-28 03:15:15,060 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-28 03:15:15,061 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-28 03:15:15,061 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-28 03:15:15,061 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-28 03:15:15,062 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-28 03:15:15,062 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-28 03:15:15,062 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-28 03:15:15,063 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-28 03:15:15,063 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-28 03:15:15,063 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-28 03:15:15,064 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-28 03:15:15,064 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-28 03:15:15,064 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-28 03:15:15,065 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-28 03:15:15,065 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-28 03:15:15,065 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-28 03:15:15,066 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-28 03:15:15,066 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-28 03:15:15,066 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-28 03:15:15,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,067 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-28 03:15:15,067 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-28 03:15:15,067 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-28 03:15:15,068 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-28 03:15:15,068 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-28 03:15:15,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,068 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-28 03:15:15,069 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-28 03:15:15,069 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-28 03:15:15,069 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-28 03:15:15,069 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-28 03:15:15,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,070 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,070 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-28 03:15:15,070 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-28 03:15:15,071 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-28 03:15:15,071 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-28 03:15:15,071 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-28 03:15:15,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,072 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-28 03:15:15,072 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-28 03:15:15,072 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-28 03:15:15,073 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-28 03:15:15,073 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-28 03:15:15,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,073 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-28 03:15:15,074 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-28 03:15:15,074 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-28 03:15:15,074 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-28 03:15:15,074 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-28 03:15:15,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,075 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,075 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-28 03:15:15,075 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-28 03:15:15,076 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-28 03:15:15,076 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-28 03:15:15,076 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-28 03:15:15,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,076 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,076 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,077 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-28 03:15:15,077 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-28 03:15:15,077 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-28 03:15:15,078 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-28 03:15:15,078 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-28 03:15:15,078 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:15:15,078 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:15:15,078 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:15:15,078 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-28 03:15:15,079 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-28 03:15:15,079 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-28 03:15:15,079 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-28 03:15:15,080 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-28 03:15:15,080 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-28 03:15:15,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {12413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12355#false} is VALID [2022-04-28 03:15:15,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-28 03:15:15,081 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-28 03:15:15,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:15,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774594396] [2022-04-28 03:15:15,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774594396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:15:15,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682917535] [2022-04-28 03:15:15,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:15:15,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:15,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:15,082 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-28 03:15:15,083 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-28 03:15:15,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:15:15,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:15:15,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 03:15:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:15,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:15,299 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-28 03:16:50,992 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-28 03:16:51,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-28 03:16:51,049 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-28 03:16:51,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:51,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-28 03:16:51,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-28 03:16:51,050 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-28 03:16:51,050 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-28 03:16:51,050 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-28 03:16:51,050 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-28 03:16:51,051 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-28 03:16:51,051 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-28 03:16:51,052 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-28 03:16:51,052 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-28 03:16:51,052 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-28 03:16:51,053 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-28 03:16:51,053 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-28 03:16:51,053 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-28 03:16:51,054 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-28 03:16:51,054 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-28 03:16:51,054 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-28 03:16:51,055 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-28 03:16:51,055 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-28 03:16:51,056 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-28 03:16:51,056 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-28 03:16:51,056 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-28 03:16:51,057 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-28 03:16:51,057 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-28 03:16:51,057 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-28 03:16:51,058 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-28 03:16:51,058 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-28 03:16:51,059 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-28 03:16:51,059 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-28 03:16:51,059 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-28 03:16:51,060 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-28 03:16:51,060 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-28 03:16:51,061 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-28 03:16:51,061 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-28 03:16:51,062 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-28 03:16:51,062 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-28 03:16:51,062 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-28 03:16:51,062 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-28 03:16:51,063 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-28 03:16:51,063 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-28 03:16:51,064 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-28 03:16:51,064 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-28 03:16:51,065 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-28 03:16:51,066 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-28 03:16:51,066 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-28 03:16:51,067 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-28 03:16:51,067 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-28 03:16:51,067 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-28 03:16:51,068 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-28 03:16:51,069 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-28 03:16:51,069 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-28 03:16:51,069 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-28 03:16:51,069 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-28 03:16:51,070 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-28 03:16:51,070 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-28 03:16:51,071 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-28 03:16:51,071 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-28 03:16:51,072 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-28 03:16:51,072 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-28 03:16:51,072 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-28 03:16:51,072 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-28 03:16:51,073 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-28 03:16:51,073 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-28 03:16:51,074 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-28 03:16:51,074 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-28 03:16:51,075 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-28 03:16:51,075 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-28 03:16:51,075 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-28 03:16:51,076 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-28 03:16:51,076 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-28 03:16:51,076 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-28 03:16:51,077 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-28 03:16:51,077 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-28 03:16:51,078 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-28 03:16:51,078 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-28 03:16:51,078 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-28 03:16:51,079 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-28 03:16:51,079 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-28 03:16:51,080 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-28 03:16:51,080 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-28 03:16:51,080 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-28 03:16:51,081 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-28 03:16:51,081 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-28 03:16:51,082 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-28 03:16:51,082 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-28 03:16:51,082 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-28 03:16:51,083 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-28 03:16:51,083 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-28 03:16:51,083 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-28 03:16:51,084 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-28 03:16:51,084 INFO L290 TraceCheckUtils]: 93: Hoare triple {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:51,084 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-28 03:16:51,084 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-28 03:16:51,085 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-28 03:16:51,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:53,368 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-28 03:16:53,374 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-28 03:16:53,507 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-28 03:16:53,507 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-28 03:16:53,508 INFO L290 TraceCheckUtils]: 93: Hoare triple {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:16:53,508 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-28 03:16:53,509 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-28 03:16:53,509 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-28 03:16:53,509 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-28 03:16:53,510 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-28 03:16:53,510 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:53,510 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:16:53,510 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:16:53,510 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-28 03:16:53,510 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-28 03:16:53,511 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-28 03:16:53,511 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-28 03:16:53,512 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-28 03:16:53,512 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:53,512 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:16:53,512 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:16:53,512 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-28 03:16:53,512 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-28 03:16:53,513 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-28 03:16:53,513 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-28 03:16:53,514 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-28 03:16:53,514 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:53,514 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:16:53,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:16:53,514 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-28 03:16:53,514 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-28 03:16:53,515 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-28 03:16:53,515 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-28 03:16:53,515 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-28 03:16:53,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:53,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:16:53,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:16:53,516 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-28 03:16:53,516 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-28 03:16:53,516 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-28 03:16:53,517 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-28 03:16:53,517 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-28 03:16:53,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:53,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:16:53,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:16:53,517 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-28 03:16:53,518 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-28 03:16:53,518 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-28 03:16:53,518 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-28 03:16:53,519 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-28 03:16:53,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:53,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:16:53,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:16:53,519 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-28 03:16:53,520 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-28 03:16:53,520 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-28 03:16:53,520 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-28 03:16:53,521 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-28 03:16:53,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:53,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:16:53,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:16:53,521 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-28 03:16:53,521 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-28 03:16:53,522 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-28 03:16:53,522 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-28 03:16:53,523 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-28 03:16:53,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:53,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 03:16:53,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 03:16:53,523 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-28 03:16:53,523 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-28 03:16:53,524 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-28 03:16:53,524 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-28 03:16:53,524 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-28 03:16:53,525 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-28 03:16:53,525 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-28 03:16:53,525 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-28 03:16:53,526 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-28 03:16:53,526 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-28 03:16:53,526 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-28 03:16:53,527 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-28 03:16:53,527 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-28 03:16:53,527 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-28 03:16:53,528 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-28 03:16:53,528 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-28 03:16:53,529 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-28 03:16:53,529 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-28 03:16:53,529 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-28 03:16:53,530 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-28 03:16:53,530 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-28 03:16:53,530 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-28 03:16:53,530 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-28 03:16:53,531 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-28 03:16:53,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-28 03:16:53,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-28 03:16:53,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 03:16:53,531 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-28 03:16:53,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-28 03:16:53,531 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-28 03:16:53,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682917535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:53,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:53,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 38 [2022-04-28 03:16:53,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:53,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1259505499] [2022-04-28 03:16:53,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1259505499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:53,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:53,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:16:53,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23549049] [2022-04-28 03:16:53,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:53,532 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-28 03:16:53,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:53,533 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-28 03:16:53,581 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-28 03:16:53,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:16:53,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:53,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:16:53,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1291, Unknown=9, NotChecked=0, Total=1406 [2022-04-28 03:16:53,582 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-28 03:16:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:56,504 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-04-28 03:16:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:16:56,504 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-28 03:16:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:56,504 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-28 03:16:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-28 03:16:56,505 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-28 03:16:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-28 03:16:56,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 89 transitions. [2022-04-28 03:16:56,594 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-28 03:16:56,595 INFO L225 Difference]: With dead ends: 112 [2022-04-28 03:16:56,595 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 03:16:56,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 178 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 97.4s TimeCoverageRelationStatistics Valid=244, Invalid=3529, Unknown=9, NotChecked=0, Total=3782 [2022-04-28 03:16:56,597 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:16:56,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 131 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:16:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 03:16:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2022-04-28 03:16:56,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:16:56,646 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-28 03:16:56,646 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-28 03:16:56,647 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-28 03:16:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:56,648 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-28 03:16:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-28 03:16:56,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:56,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:56,648 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-28 03:16:56,649 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-28 03:16:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:56,650 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-28 03:16:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-28 03:16:56,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:16:56,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:16:56,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:16:56,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:16:56,650 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-28 03:16:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-28 03:16:56,651 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2022-04-28 03:16:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:16:56,652 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-28 03:16:56,652 INFO L496 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-28 03:16:56,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-28 03:16:56,804 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-28 03:16:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-28 03:16:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 03:16:56,804 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:16:56,804 INFO L195 NwaCegarLoop]: 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-28 03:16:56,830 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-28 03:16:57,005 WARN L477 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-28 03:16:57,005 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:16:57,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:16:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 33 times [2022-04-28 03:16:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:57,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [264517766] [2022-04-28 03:16:57,008 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:16:57,008 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:16:57,008 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:16:57,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 34 times [2022-04-28 03:16:57,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:16:57,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573077663] [2022-04-28 03:16:57,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:16:57,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:16:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:16:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,239 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-28 03:16:57,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-28 03:16:57,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 03:16:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,246 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-28 03:16:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 03:16:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,250 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-28 03:16:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 03:16:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,253 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-28 03:16:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 03:16:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,256 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-28 03:16:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:16:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,259 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-28 03:16:57,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 03:16:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,262 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-28 03:16:57,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 03:16:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,265 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-28 03:16:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-28 03:16:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,268 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-28 03:16:57,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-28 03:16:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,273 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-28 03:16:57,274 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-28 03:16:57,274 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-28 03:16:57,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-28 03:16:57,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-28 03:16:57,274 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-28 03:16:57,274 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-28 03:16:57,275 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-28 03:16:57,275 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-28 03:16:57,275 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-28 03:16:57,275 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-28 03:16:57,276 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-28 03:16:57,276 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-28 03:16:57,276 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-28 03:16:57,277 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-28 03:16:57,277 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-28 03:16:57,277 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-28 03:16:57,277 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-28 03:16:57,278 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-28 03:16:57,278 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-28 03:16:57,278 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-28 03:16:57,278 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-28 03:16:57,279 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-28 03:16:57,279 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-28 03:16:57,279 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-28 03:16:57,280 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-28 03:16:57,280 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-28 03:16:57,280 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-28 03:16:57,280 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-28 03:16:57,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,281 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-28 03:16:57,281 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-28 03:16:57,281 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-28 03:16:57,282 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-28 03:16:57,282 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-28 03:16:57,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,282 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-28 03:16:57,282 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-28 03:16:57,283 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-28 03:16:57,283 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-28 03:16:57,283 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-28 03:16:57,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,284 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-28 03:16:57,284 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-28 03:16:57,284 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-28 03:16:57,284 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-28 03:16:57,284 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-28 03:16:57,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,285 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-28 03:16:57,285 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-28 03:16:57,286 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-28 03:16:57,286 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-28 03:16:57,286 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-28 03:16:57,286 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,286 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,286 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-28 03:16:57,287 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-28 03:16:57,287 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-28 03:16:57,287 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-28 03:16:57,287 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-28 03:16:57,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,287 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,288 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-28 03:16:57,288 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-28 03:16:57,288 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-28 03:16:57,288 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-28 03:16:57,289 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-28 03:16:57,289 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,289 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,289 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,289 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-28 03:16:57,289 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-28 03:16:57,290 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-28 03:16:57,290 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-28 03:16:57,290 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-28 03:16:57,290 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,290 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,290 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,290 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-28 03:16:57,291 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-28 03:16:57,291 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-28 03:16:57,291 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-28 03:16:57,291 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-28 03:16:57,291 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:57,291 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:57,291 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:57,292 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-28 03:16:57,292 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-28 03:16:57,292 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-28 03:16:57,293 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-28 03:16:57,293 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-28 03:16:57,293 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-28 03:16:57,293 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-28 03:16:57,293 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-28 03:16:57,293 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-28 03:16:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:16:57,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573077663] [2022-04-28 03:16:57,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573077663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:16:57,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823114336] [2022-04-28 03:16:57,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:16:57,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:16:57,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:16:57,295 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-28 03:16:57,297 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-28 03:16:57,441 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:16:57,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:16:57,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:16:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:16:57,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:16:58,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-28 03:16:58,172 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-28 03:16:58,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-28 03:16:58,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-28 03:16:58,172 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-28 03:16:58,173 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-28 03:16:58,173 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-28 03:16:58,173 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-28 03:16:58,174 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-28 03:16:58,174 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-28 03:16:58,174 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-28 03:16:58,175 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-28 03:16:58,175 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-28 03:16:58,175 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-28 03:16:58,175 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-28 03:16:58,176 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-28 03:16:58,176 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-28 03:16:58,176 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-28 03:16:58,177 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-28 03:16:58,177 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-28 03:16:58,177 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-28 03:16:58,177 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-28 03:16:58,178 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-28 03:16:58,178 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-28 03:16:58,178 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-28 03:16:58,179 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-28 03:16:58,179 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-28 03:16:58,179 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-28 03:16:58,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,182 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-28 03:16:58,182 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-28 03:16:58,183 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-28 03:16:58,183 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-28 03:16:58,183 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-28 03:16:58,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,184 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-28 03:16:58,184 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-28 03:16:58,185 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-28 03:16:58,185 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-28 03:16:58,185 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-28 03:16:58,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,185 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-28 03:16:58,186 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-28 03:16:58,186 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-28 03:16:58,187 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-28 03:16:58,187 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-28 03:16:58,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,198 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-28 03:16:58,199 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-28 03:16:58,199 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-28 03:16:58,200 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-28 03:16:58,200 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-28 03:16:58,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,200 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-28 03:16:58,201 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-28 03:16:58,201 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-28 03:16:58,201 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-28 03:16:58,202 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-28 03:16:58,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,202 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,202 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-28 03:16:58,202 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-28 03:16:58,203 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-28 03:16:58,203 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-28 03:16:58,203 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-28 03:16:58,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,203 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,203 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,204 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-28 03:16:58,204 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-28 03:16:58,205 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-28 03:16:58,205 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-28 03:16:58,205 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-28 03:16:58,205 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,205 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,205 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,206 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-28 03:16:58,206 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-28 03:16:58,206 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-28 03:16:58,207 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-28 03:16:58,207 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-28 03:16:58,207 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,207 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,207 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,210 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-28 03:16:58,211 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-28 03:16:58,211 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-28 03:16:58,211 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-28 03:16:58,211 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-28 03:16:58,212 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-28 03:16:58,212 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-28 03:16:58,212 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-28 03:16:58,212 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-28 03:16:58,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:16:58,652 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-28 03:16:58,652 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-28 03:16:58,652 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-28 03:16:58,653 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-28 03:16:58,653 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-28 03:16:58,653 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-28 03:16:58,654 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-28 03:16:58,654 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-28 03:16:58,654 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,654 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,654 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,654 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-28 03:16:58,654 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-28 03:16:58,655 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-28 03:16:58,655 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-28 03:16:58,656 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-28 03:16:58,656 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,656 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,656 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,656 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-28 03:16:58,659 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-28 03:16:58,660 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-28 03:16:58,660 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-28 03:16:58,660 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-28 03:16:58,660 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,660 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,660 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,660 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-28 03:16:58,676 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-28 03:16:58,676 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-28 03:16:58,677 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-28 03:16:58,677 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-28 03:16:58,678 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,678 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,678 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,678 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-28 03:16:58,678 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-28 03:16:58,679 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-28 03:16:58,679 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-28 03:16:58,680 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-28 03:16:58,680 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,680 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-28 03:16:58,680 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-28 03:16:58,681 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-28 03:16:58,681 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-28 03:16:58,682 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-28 03:16:58,682 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,682 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,682 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,682 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-28 03:16:58,683 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-28 03:16:58,683 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-28 03:16:58,684 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-28 03:16:58,684 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-28 03:16:58,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,684 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-28 03:16:58,685 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-28 03:16:58,685 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-28 03:16:58,686 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-28 03:16:58,686 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-28 03:16:58,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,687 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-28 03:16:58,687 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-28 03:16:58,687 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-28 03:16:58,688 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-28 03:16:58,689 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-28 03:16:58,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 03:16:58,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 03:16:58,689 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-28 03:16:58,689 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-28 03:16:58,690 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-28 03:16:58,690 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-28 03:16:58,691 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-28 03:16:58,691 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-28 03:16:58,691 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-28 03:16:58,692 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-28 03:16:58,692 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-28 03:16:58,693 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-28 03:16:58,693 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-28 03:16:58,694 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-28 03:16:58,694 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-28 03:16:58,694 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-28 03:16:58,695 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-28 03:16:58,695 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-28 03:16:58,696 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-28 03:16:58,696 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-28 03:16:58,696 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-28 03:16:58,697 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-28 03:16:58,697 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-28 03:16:58,697 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-28 03:16:58,698 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-28 03:16:58,698 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-28 03:16:58,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-28 03:16:58,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-28 03:16:58,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 03:16:58,698 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-28 03:16:58,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-28 03:16:58,698 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-28 03:16:58,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823114336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:16:58,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:16:58,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 36 [2022-04-28 03:16:58,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:16:58,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [264517766] [2022-04-28 03:16:58,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [264517766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:16:58,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:16:58,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:16:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073910514] [2022-04-28 03:16:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:16:58,700 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-28 03:16:58,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:16:58,700 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-28 03:16:58,748 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-28 03:16:58,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:16:58,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:16:58,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:16:58,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:16:58,749 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-28 03:16:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:16:59,843 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-04-28 03:16:59,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:16:59,843 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-28 03:16:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:16:59,843 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-28 03:16:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-28 03:16:59,845 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-28 03:16:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-28 03:16:59,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 99 transitions. [2022-04-28 03:16:59,952 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-28 03:16:59,953 INFO L225 Difference]: With dead ends: 158 [2022-04-28 03:16:59,953 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 03:16:59,954 INFO L412 NwaCegarLoop]: 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-28 03:16:59,955 INFO L413 NwaCegarLoop]: 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-28 03:16:59,955 INFO L414 NwaCegarLoop]: 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-28 03:16:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 03:17:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-28 03:17:00,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:00,007 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-28 03:17:00,007 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-28 03:17:00,007 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-28 03:17:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:00,008 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-28 03:17:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-28 03:17:00,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:00,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:00,009 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-28 03:17:00,009 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-28 03:17:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:00,010 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-28 03:17:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-28 03:17:00,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:00,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:00,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:00,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:00,011 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-28 03:17:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-04-28 03:17:00,012 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-04-28 03:17:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:00,012 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-04-28 03:17:00,012 INFO L496 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-28 03:17:00,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 110 transitions. [2022-04-28 03:17:00,171 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-28 03:17:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-28 03:17:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 03:17:00,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:00,172 INFO L195 NwaCegarLoop]: 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-28 03:17:00,189 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-28 03:17:00,378 WARN L477 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-28 03:17:00,379 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 35 times [2022-04-28 03:17:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:00,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105695880] [2022-04-28 03:17:00,381 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:17:00,381 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:17:00,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:17:00,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 36 times [2022-04-28 03:17:00,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:00,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702489937] [2022-04-28 03:17:00,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:00,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,812 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-28 03:17:00,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-28 03:17:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 03:17:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,816 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-28 03:17:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:17:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,819 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-28 03:17:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 03:17:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,822 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-28 03:17:00,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 03:17:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,827 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-28 03:17:00,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 03:17:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,830 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-28 03:17:00,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 03:17:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,834 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-28 03:17:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-28 03:17:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,839 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-28 03:17:00,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-28 03:17:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,842 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-28 03:17:00,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 03:17:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:00,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,845 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-28 03:17:00,846 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-28 03:17:00,846 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-28 03:17:00,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-28 03:17:00,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-28 03:17:00,846 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-28 03:17:00,846 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-28 03:17:00,847 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-28 03:17:00,847 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-28 03:17:00,847 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-28 03:17:00,848 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-28 03:17:00,848 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-28 03:17:00,848 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-28 03:17:00,849 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-28 03:17:00,849 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-28 03:17:00,849 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-28 03:17:00,850 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-28 03:17:00,850 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-28 03:17:00,850 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-28 03:17:00,851 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-28 03:17:00,851 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-28 03:17:00,852 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-28 03:17:00,852 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-28 03:17:00,852 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-28 03:17:00,853 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-28 03:17:00,853 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-28 03:17:00,854 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-28 03:17:00,854 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-28 03:17:00,854 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-28 03:17:00,855 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-28 03:17:00,855 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-28 03:17:00,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,855 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-28 03:17:00,856 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-28 03:17:00,856 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-28 03:17:00,856 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-28 03:17:00,856 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-28 03:17:00,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,857 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-28 03:17:00,857 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-28 03:17:00,858 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-28 03:17:00,858 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-28 03:17:00,858 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-28 03:17:00,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,859 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-28 03:17:00,859 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-28 03:17:00,860 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-28 03:17:00,860 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-28 03:17:00,860 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-28 03:17:00,860 INFO L290 TraceCheckUtils]: 55: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,860 INFO L290 TraceCheckUtils]: 57: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,861 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-28 03:17:00,861 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-28 03:17:00,861 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-28 03:17:00,862 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-28 03:17:00,862 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-28 03:17:00,862 INFO L290 TraceCheckUtils]: 63: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,862 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-28 03:17:00,863 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-28 03:17:00,863 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-28 03:17:00,864 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-28 03:17:00,864 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-28 03:17:00,864 INFO L290 TraceCheckUtils]: 71: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,864 INFO L290 TraceCheckUtils]: 72: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,864 INFO L290 TraceCheckUtils]: 73: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,864 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-28 03:17:00,865 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-28 03:17:00,865 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-28 03:17:00,866 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-28 03:17:00,866 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-28 03:17:00,866 INFO L290 TraceCheckUtils]: 79: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,866 INFO L290 TraceCheckUtils]: 81: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,866 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-28 03:17:00,867 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-28 03:17:00,867 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-28 03:17:00,868 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-28 03:17:00,868 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-28 03:17:00,868 INFO L290 TraceCheckUtils]: 87: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,868 INFO L290 TraceCheckUtils]: 88: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,868 INFO L290 TraceCheckUtils]: 89: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,868 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-28 03:17:00,869 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-28 03:17:00,869 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-28 03:17:00,869 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-28 03:17:00,869 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-28 03:17:00,869 INFO L290 TraceCheckUtils]: 95: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 03:17:00,870 INFO L290 TraceCheckUtils]: 96: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 03:17:00,870 INFO L290 TraceCheckUtils]: 97: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:00,870 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-28 03:17:00,870 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-28 03:17:00,871 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-28 03:17:00,871 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-28 03:17:00,872 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-28 03:17:00,872 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-28 03:17:00,872 INFO L290 TraceCheckUtils]: 104: Hoare triple {15267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15203#false} is VALID [2022-04-28 03:17:00,872 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-28 03:17:00,873 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-28 03:17:00,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:00,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702489937] [2022-04-28 03:17:00,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702489937] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:00,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809214301] [2022-04-28 03:17:00,873 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:17:00,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:00,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:00,874 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-28 03:17:00,877 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-28 03:17:01,048 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-28 03:17:01,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:01,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:17:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:01,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:01,369 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-28 03:17:08,941 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:17:08,942 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-28 03:17:09,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {15202#true} call ULTIMATE.init(); {15202#true} is VALID [2022-04-28 03:17:09,027 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-28 03:17:09,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 03:17:09,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-28 03:17:09,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-28 03:17:09,027 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-28 03:17:09,028 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-28 03:17:09,028 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-28 03:17:09,028 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-28 03:17:09,029 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-28 03:17:09,029 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-28 03:17:09,029 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-28 03:17:09,030 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-28 03:17:09,030 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-28 03:17:09,030 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-28 03:17:09,030 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-28 03:17:09,040 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-28 03:17:09,040 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-28 03:17:09,041 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-28 03:17:09,041 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-28 03:17:09,042 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-28 03:17:09,042 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-28 03:17:09,042 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-28 03:17:09,043 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-28 03:17:09,043 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-28 03:17:09,044 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-28 03:17:09,045 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-28 03:17:09,046 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-28 03:17:09,047 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-28 03:17:09,047 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-28 03:17:09,051 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-28 03:17:09,052 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-28 03:17:09,052 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-28 03:17:09,053 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-28 03:17:09,053 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-28 03:17:09,054 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-28 03:17:09,055 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-28 03:17:09,055 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-28 03:17:09,059 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-28 03:17:09,060 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-28 03:17:09,061 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-28 03:17:09,066 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-28 03:17:09,067 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-28 03:17:09,067 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-28 03:17:09,068 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-28 03:17:09,069 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-28 03:17:09,072 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-28 03:17:09,073 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-28 03:17:09,076 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-28 03:17:09,076 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-28 03:17:09,077 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-28 03:17:09,078 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-28 03:17:09,078 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-28 03:17:09,079 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-28 03:17:09,082 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-28 03:17:09,084 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-28 03:17:09,085 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-28 03:17:09,085 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-28 03:17:09,086 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-28 03:17:09,086 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-28 03:17:09,087 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-28 03:17:09,088 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-28 03:17:09,091 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-28 03:17:09,093 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-28 03:17:09,094 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-28 03:17:09,095 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-28 03:17:09,111 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-28 03:17:09,112 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-28 03:17:09,113 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-28 03:17:09,113 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-28 03:17:09,116 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-28 03:17:09,118 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-28 03:17:09,119 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-28 03:17:09,121 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-28 03:17:09,122 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-28 03:17:09,123 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-28 03:17:09,123 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-28 03:17:09,124 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-28 03:17:09,134 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-28 03:17:09,137 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-28 03:17:09,138 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-28 03:17:09,142 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-28 03:17:09,143 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-28 03:17:09,143 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-28 03:17:09,144 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-28 03:17:09,145 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-28 03:17:09,147 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-28 03:17:09,169 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-28 03:17:09,170 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-28 03:17:09,171 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-28 03:17:09,171 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-28 03:17:09,172 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-28 03:17:09,172 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-28 03:17:09,173 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-28 03:17:09,178 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-28 03:17:09,185 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-28 03:17:09,187 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-28 03:17:09,188 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-28 03:17:09,189 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-28 03:17:09,189 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-28 03:17:09,190 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-28 03:17:09,191 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-28 03:17:09,191 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-28 03:17:09,191 INFO L290 TraceCheckUtils]: 103: Hoare triple {15602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:09,192 INFO L290 TraceCheckUtils]: 104: Hoare triple {15606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15203#false} is VALID [2022-04-28 03:17:09,192 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-28 03:17:09,192 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-28 03:17:09,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:09,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809214301] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:09,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:09,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2022-04-28 03:17:09,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:09,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105695880] [2022-04-28 03:17:09,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105695880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:09,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:09,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 03:17:09,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177542712] [2022-04-28 03:17:09,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:09,482 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-28 03:17:09,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:09,482 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-28 03:17:09,533 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-28 03:17:09,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 03:17:09,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 03:17:09,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2777, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 03:17:09,534 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-28 03:17:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:13,020 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2022-04-28 03:17:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:17:13,020 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-28 03:17:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:13,020 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-28 03:17:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-28 03:17:13,022 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-28 03:17:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-28 03:17:13,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 96 transitions. [2022-04-28 03:17:13,129 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-28 03:17:13,130 INFO L225 Difference]: With dead ends: 122 [2022-04-28 03:17:13,130 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 03:17:13,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 88 SyntacticMatches, 18 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=511, Invalid=6131, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:17:13,133 INFO L413 NwaCegarLoop]: 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-28 03:17:13,133 INFO L414 NwaCegarLoop]: 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-28 03:17:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 03:17:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-04-28 03:17:13,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:13,188 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-28 03:17:13,188 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-28 03:17:13,188 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-28 03:17:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:13,189 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-28 03:17:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-28 03:17:13,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:13,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:13,190 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-28 03:17:13,190 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-28 03:17:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:13,192 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-28 03:17:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-28 03:17:13,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:13,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:13,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:13,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:13,192 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-28 03:17:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2022-04-28 03:17:13,193 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2022-04-28 03:17:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:13,194 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2022-04-28 03:17:13,194 INFO L496 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-28 03:17:13,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 118 transitions. [2022-04-28 03:17:13,368 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-28 03:17:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-28 03:17:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 03:17:13,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:13,369 INFO L195 NwaCegarLoop]: 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-28 03:17:13,385 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-28 03:17:13,569 WARN L477 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-28 03:17:13,569 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:13,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 37 times [2022-04-28 03:17:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:13,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028630690] [2022-04-28 03:17:13,571 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:17:13,571 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:17:13,571 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:17:13,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 38 times [2022-04-28 03:17:13,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:13,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992273232] [2022-04-28 03:17:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,822 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-28 03:17:13,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-28 03:17:13,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 03:17:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,829 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-28 03:17:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:17:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,847 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-28 03:17:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 03:17:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,850 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-28 03:17:13,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 03:17:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,853 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-28 03:17:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 03:17:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,856 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-28 03:17:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 03:17:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,859 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-28 03:17:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-28 03:17:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,862 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-28 03:17:13,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-28 03:17:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,865 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-28 03:17:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 03:17:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,870 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-28 03:17:13,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-28 03:17:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:13,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,873 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-28 03:17:13,873 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-28 03:17:13,873 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-28 03:17:13,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-28 03:17:13,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-28 03:17:13,873 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-28 03:17:13,874 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-28 03:17:13,874 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-28 03:17:13,874 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-28 03:17:13,874 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-28 03:17:13,875 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-28 03:17:13,875 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-28 03:17:13,875 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-28 03:17:13,876 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-28 03:17:13,876 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-28 03:17:13,876 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-28 03:17:13,876 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-28 03:17:13,877 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-28 03:17:13,877 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-28 03:17:13,877 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-28 03:17:13,878 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-28 03:17:13,878 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-28 03:17:13,878 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-28 03:17:13,878 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-28 03:17:13,879 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-28 03:17:13,879 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-28 03:17:13,879 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-28 03:17:13,880 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-28 03:17:13,880 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-28 03:17:13,880 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-28 03:17:13,880 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-28 03:17:13,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,881 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-28 03:17:13,881 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-28 03:17:13,882 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-28 03:17:13,882 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-28 03:17:13,882 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-28 03:17:13,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,882 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-28 03:17:13,883 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-28 03:17:13,883 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-28 03:17:13,883 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-28 03:17:13,883 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-28 03:17:13,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,884 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-28 03:17:13,884 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-28 03:17:13,885 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-28 03:17:13,885 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-28 03:17:13,885 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-28 03:17:13,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,885 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,885 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-28 03:17:13,886 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-28 03:17:13,886 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-28 03:17:13,886 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-28 03:17:13,886 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-28 03:17:13,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,886 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,886 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,887 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-28 03:17:13,887 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-28 03:17:13,887 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-28 03:17:13,888 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-28 03:17:13,888 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-28 03:17:13,888 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,888 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,888 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,888 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-28 03:17:13,889 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-28 03:17:13,889 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-28 03:17:13,889 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-28 03:17:13,889 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-28 03:17:13,889 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,889 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,889 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,890 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-28 03:17:13,890 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-28 03:17:13,890 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-28 03:17:13,891 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-28 03:17:13,891 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-28 03:17:13,891 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,891 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,891 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,891 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-28 03:17:13,891 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-28 03:17:13,892 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-28 03:17:13,892 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-28 03:17:13,892 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-28 03:17:13,892 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,892 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,892 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,893 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-28 03:17:13,893 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-28 03:17:13,893 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-28 03:17:13,894 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-28 03:17:13,894 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-28 03:17:13,894 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:13,894 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:13,894 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:13,894 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-28 03:17:13,894 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-28 03:17:13,895 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-28 03:17:13,895 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-28 03:17:13,895 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-28 03:17:13,895 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-28 03:17:13,895 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-28 03:17:13,895 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-28 03:17:13,896 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-28 03:17:13,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:13,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992273232] [2022-04-28 03:17:13,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992273232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:13,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407856150] [2022-04-28 03:17:13,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:17:13,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:13,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:13,897 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-28 03:17:13,897 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-28 03:17:13,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:17:13,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:13,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:17:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:14,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:14,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-28 03:17:14,753 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-28 03:17:14,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-28 03:17:14,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-28 03:17:14,753 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-28 03:17:14,753 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-28 03:17:14,753 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-28 03:17:14,754 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-28 03:17:14,754 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-28 03:17:14,754 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-28 03:17:14,755 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-28 03:17:14,755 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-28 03:17:14,755 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-28 03:17:14,756 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-28 03:17:14,756 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-28 03:17:14,756 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-28 03:17:14,756 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-28 03:17:14,757 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-28 03:17:14,757 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-28 03:17:14,757 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-28 03:17:14,758 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-28 03:17:14,758 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-28 03:17:14,758 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-28 03:17:14,759 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-28 03:17:14,759 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-28 03:17:14,759 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-28 03:17:14,759 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-28 03:17:14,760 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-28 03:17:14,760 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-28 03:17:14,760 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-28 03:17:14,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,761 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-28 03:17:14,761 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-28 03:17:14,761 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-28 03:17:14,762 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-28 03:17:14,762 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-28 03:17:14,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,762 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-28 03:17:14,763 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-28 03:17:14,763 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-28 03:17:14,763 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-28 03:17:14,763 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-28 03:17:14,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,764 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-28 03:17:14,764 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-28 03:17:14,765 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-28 03:17:14,765 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-28 03:17:14,765 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-28 03:17:14,765 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,765 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,765 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,766 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-28 03:17:14,766 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-28 03:17:14,766 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-28 03:17:14,767 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-28 03:17:14,767 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-28 03:17:14,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,767 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-28 03:17:14,767 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-28 03:17:14,768 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-28 03:17:14,768 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-28 03:17:14,768 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-28 03:17:14,768 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,769 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-28 03:17:14,769 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-28 03:17:14,769 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-28 03:17:14,770 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-28 03:17:14,770 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-28 03:17:14,770 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,770 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,770 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,770 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-28 03:17:14,771 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-28 03:17:14,771 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-28 03:17:14,775 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-28 03:17:14,775 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-28 03:17:14,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,776 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,776 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,776 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-28 03:17:14,776 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-28 03:17:14,777 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-28 03:17:14,777 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-28 03:17:14,777 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-28 03:17:14,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,778 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-28 03:17:14,778 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-28 03:17:14,779 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-28 03:17:14,779 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-28 03:17:14,779 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-28 03:17:14,779 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:14,779 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:14,779 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:14,780 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-28 03:17:14,780 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-28 03:17:14,780 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-28 03:17:14,781 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-28 03:17:14,781 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-28 03:17:14,781 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-28 03:17:14,781 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-28 03:17:14,781 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-28 03:17:14,781 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-28 03:17:14,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:15,230 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-28 03:17:15,230 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-28 03:17:15,230 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-28 03:17:15,230 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-28 03:17:15,231 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-28 03:17:15,233 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-28 03:17:15,233 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-28 03:17:15,234 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-28 03:17:15,234 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,234 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,234 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,234 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-28 03:17:15,234 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-28 03:17:15,235 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-28 03:17:15,235 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-28 03:17:15,235 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-28 03:17:15,235 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,236 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,236 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-28 03:17:15,236 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-28 03:17:15,236 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-28 03:17:15,237 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-28 03:17:15,237 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-28 03:17:15,237 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,237 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,237 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,237 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-28 03:17:15,237 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-28 03:17:15,238 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-28 03:17:15,238 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-28 03:17:15,238 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-28 03:17:15,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,239 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,239 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-28 03:17:15,239 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-28 03:17:15,239 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-28 03:17:15,239 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-28 03:17:15,240 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-28 03:17:15,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,240 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-28 03:17:15,240 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-28 03:17:15,241 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-28 03:17:15,241 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-28 03:17:15,241 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-28 03:17:15,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,242 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-28 03:17:15,242 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-28 03:17:15,242 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-28 03:17:15,242 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-28 03:17:15,243 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-28 03:17:15,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,243 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,243 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-28 03:17:15,243 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-28 03:17:15,244 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-28 03:17:15,244 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-28 03:17:15,244 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-28 03:17:15,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,245 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-28 03:17:15,245 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-28 03:17:15,245 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-28 03:17:15,245 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-28 03:17:15,246 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-28 03:17:15,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,246 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-28 03:17:15,246 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-28 03:17:15,247 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-28 03:17:15,247 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-28 03:17:15,247 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-28 03:17:15,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 03:17:15,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 03:17:15,248 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-28 03:17:15,248 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-28 03:17:15,248 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-28 03:17:15,248 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-28 03:17:15,249 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-28 03:17:15,249 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-28 03:17:15,249 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-28 03:17:15,250 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-28 03:17:15,250 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-28 03:17:15,250 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-28 03:17:15,250 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-28 03:17:15,251 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-28 03:17:15,251 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-28 03:17:15,251 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-28 03:17:15,252 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-28 03:17:15,252 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-28 03:17:15,252 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-28 03:17:15,252 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-28 03:17:15,253 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-28 03:17:15,253 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-28 03:17:15,253 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-28 03:17:15,254 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-28 03:17:15,254 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-28 03:17:15,254 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-28 03:17:15,255 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-28 03:17:15,255 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-28 03:17:15,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-28 03:17:15,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-28 03:17:15,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 03:17:15,255 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-28 03:17:15,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-28 03:17:15,255 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-28 03:17:15,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407856150] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:15,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:17:15,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 39 [2022-04-28 03:17:15,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:15,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028630690] [2022-04-28 03:17:15,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028630690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:15,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:15,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:17:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260046718] [2022-04-28 03:17:15,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:15,256 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-28 03:17:15,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:15,257 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-28 03:17:15,306 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-28 03:17:15,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:17:15,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:15,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:17:15,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:17:15,307 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-28 03:17:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:16,334 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2022-04-28 03:17:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:17:16,334 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-28 03:17:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:16,335 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-28 03:17:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-28 03:17:16,340 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-28 03:17:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-28 03:17:16,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 106 transitions. [2022-04-28 03:17:16,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-28 03:17:16,422 INFO L225 Difference]: With dead ends: 172 [2022-04-28 03:17:16,422 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 03:17:16,423 INFO L412 NwaCegarLoop]: 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-28 03:17:16,423 INFO L413 NwaCegarLoop]: 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-28 03:17:16,423 INFO L414 NwaCegarLoop]: 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-28 03:17:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 03:17:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-28 03:17:16,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:16,505 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-28 03:17:16,505 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-28 03:17:16,506 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-28 03:17:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:16,507 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-28 03:17:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-28 03:17:16,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:16,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:16,507 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-28 03:17:16,508 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-28 03:17:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:16,510 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-28 03:17:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-28 03:17:16,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:16,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:16,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:16,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:16,510 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-28 03:17:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-28 03:17:16,512 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-04-28 03:17:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:16,512 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-28 03:17:16,512 INFO L496 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-28 03:17:16,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-28 03:17:16,686 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-28 03:17:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-28 03:17:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 03:17:16,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:16,687 INFO L195 NwaCegarLoop]: 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-28 03:17:16,703 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-28 03:17:16,887 WARN L477 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-28 03:17:16,888 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:16,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 39 times [2022-04-28 03:17:16,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:16,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927418196] [2022-04-28 03:17:16,890 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:17:16,890 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:17:16,890 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:17:16,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 40 times [2022-04-28 03:17:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:16,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984175651] [2022-04-28 03:17:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:16,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,304 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-28 03:17:17,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-28 03:17:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 03:17:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,309 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-28 03:17:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 03:17:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,312 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-28 03:17:17,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:17:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,315 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-28 03:17:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 03:17:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,329 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-28 03:17:17,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 03:17:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,335 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-28 03:17:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:17:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,338 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-28 03:17:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-28 03:17:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,341 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-28 03:17:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-28 03:17:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,344 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-28 03:17:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-28 03:17:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,348 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-28 03:17:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-28 03:17:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,351 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-28 03:17:17,351 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-28 03:17:17,352 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-28 03:17:17,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-28 03:17:17,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-28 03:17:17,352 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-28 03:17:17,352 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-28 03:17:17,352 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-28 03:17:17,353 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-28 03:17:17,353 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-28 03:17:17,353 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-28 03:17:17,354 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-28 03:17:17,354 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-28 03:17:17,354 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-28 03:17:17,355 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-28 03:17:17,355 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-28 03:17:17,355 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-28 03:17:17,356 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-28 03:17:17,366 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-28 03:17:17,366 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-28 03:17:17,367 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-28 03:17:17,367 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-28 03:17:17,367 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-28 03:17:17,368 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-28 03:17:17,368 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-28 03:17:17,368 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-28 03:17:17,369 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-28 03:17:17,369 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-28 03:17:17,370 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-28 03:17:17,370 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-28 03:17:17,370 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-28 03:17:17,370 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-28 03:17:17,371 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-28 03:17:17,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,371 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-28 03:17:17,371 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-28 03:17:17,372 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-28 03:17:17,372 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-28 03:17:17,372 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-28 03:17:17,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,373 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-28 03:17:17,373 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-28 03:17:17,374 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-28 03:17:17,374 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-28 03:17:17,374 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-28 03:17:17,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,374 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-28 03:17:17,375 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-28 03:17:17,375 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-28 03:17:17,376 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-28 03:17:17,376 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-28 03:17:17,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,376 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-28 03:17:17,377 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-28 03:17:17,377 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-28 03:17:17,377 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-28 03:17:17,377 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-28 03:17:17,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,377 INFO L290 TraceCheckUtils]: 67: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,378 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-28 03:17:17,378 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-28 03:17:17,379 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-28 03:17:17,379 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-28 03:17:17,379 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-28 03:17:17,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,379 INFO L290 TraceCheckUtils]: 74: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,379 INFO L290 TraceCheckUtils]: 75: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,380 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-28 03:17:17,380 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-28 03:17:17,380 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-28 03:17:17,381 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-28 03:17:17,381 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-28 03:17:17,381 INFO L290 TraceCheckUtils]: 81: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,381 INFO L290 TraceCheckUtils]: 82: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,381 INFO L290 TraceCheckUtils]: 83: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,381 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-28 03:17:17,382 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-28 03:17:17,382 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-28 03:17:17,383 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-28 03:17:17,383 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-28 03:17:17,383 INFO L290 TraceCheckUtils]: 89: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,383 INFO L290 TraceCheckUtils]: 90: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,383 INFO L290 TraceCheckUtils]: 91: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,383 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-28 03:17:17,384 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-28 03:17:17,384 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-28 03:17:17,384 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-28 03:17:17,384 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-28 03:17:17,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,385 INFO L290 TraceCheckUtils]: 98: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,385 INFO L290 TraceCheckUtils]: 99: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,385 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-28 03:17:17,385 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-28 03:17:17,386 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-28 03:17:17,386 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-28 03:17:17,386 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-28 03:17:17,386 INFO L290 TraceCheckUtils]: 105: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 03:17:17,386 INFO L290 TraceCheckUtils]: 106: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 03:17:17,386 INFO L290 TraceCheckUtils]: 107: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:17,387 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-28 03:17:17,387 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-28 03:17:17,388 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-28 03:17:17,388 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-28 03:17:17,388 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-28 03:17:17,389 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-28 03:17:17,389 INFO L290 TraceCheckUtils]: 114: Hoare triple {18112#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18042#false} is VALID [2022-04-28 03:17:17,389 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-28 03:17:17,389 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-28 03:17:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:17,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984175651] [2022-04-28 03:17:17,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984175651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:17,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598799635] [2022-04-28 03:17:17,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:17:17,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:17,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:17,391 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-28 03:17:17,391 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-28 03:17:17,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:17:17,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:17,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 03:17:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:17,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:17,889 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-28 03:17:26,369 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:17:26,370 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-28 03:17:26,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {18041#true} call ULTIMATE.init(); {18041#true} is VALID [2022-04-28 03:17:26,473 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-28 03:17:26,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 03:17:26,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-28 03:17:26,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-28 03:17:26,474 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-28 03:17:26,474 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-28 03:17:26,474 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-28 03:17:26,475 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-28 03:17:26,475 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-28 03:17:26,475 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-28 03:17:26,476 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-28 03:17:26,476 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-28 03:17:26,476 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-28 03:17:26,476 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-28 03:17:26,477 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-28 03:17:26,477 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-28 03:17:26,477 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-28 03:17:26,478 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-28 03:17:26,478 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-28 03:17:26,478 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-28 03:17:26,478 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-28 03:17:26,479 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-28 03:17:26,479 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-28 03:17:26,479 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-28 03:17:26,480 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-28 03:17:26,480 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-28 03:17:26,480 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-28 03:17:26,482 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-28 03:17:26,483 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-28 03:17:26,483 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-28 03:17:26,484 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-28 03:17:26,485 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-28 03:17:26,485 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-28 03:17:26,486 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-28 03:17:26,488 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-28 03:17:26,488 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-28 03:17:26,489 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-28 03:17:26,489 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-28 03:17:26,490 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-28 03:17:26,491 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-28 03:17:26,495 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-28 03:17:26,497 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-28 03:17:26,498 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-28 03:17:26,498 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-28 03:17:26,499 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-28 03:17:26,499 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-28 03:17:26,500 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-28 03:17:26,501 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-28 03:17:26,501 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-28 03:17:26,502 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-28 03:17:26,504 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-28 03:17:26,505 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-28 03:17:26,505 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-28 03:17:26,506 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-28 03:17:26,506 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-28 03:17:26,507 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-28 03:17:26,508 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-28 03:17:26,508 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-28 03:17:26,509 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-28 03:17:26,509 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-28 03:17:26,510 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-28 03:17:26,511 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-28 03:17:26,511 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-28 03:17:26,512 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-28 03:17:26,513 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-28 03:17:26,586 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-28 03:17:26,587 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-28 03:17:26,587 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-28 03:17:26,588 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-28 03:17:26,588 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-28 03:17:26,589 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-28 03:17:26,590 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-28 03:17:26,593 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-28 03:17:26,595 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-28 03:17:26,596 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-28 03:17:26,597 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-28 03:17:26,597 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-28 03:17:26,598 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-28 03:17:26,599 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-28 03:17:26,599 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-28 03:17:26,602 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-28 03:17:26,608 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-28 03:17:26,608 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-28 03:17:26,609 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-28 03:17:26,609 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-28 03:17:26,610 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-28 03:17:26,611 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-28 03:17:26,612 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-28 03:17:26,612 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-28 03:17:26,613 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-28 03:17:26,613 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-28 03:17:26,614 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-28 03:17:26,614 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-28 03:17:26,615 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-28 03:17:26,615 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-28 03:17:26,616 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-28 03:17:26,617 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-28 03:17:26,617 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-28 03:17:26,618 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-28 03:17:26,618 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-28 03:17:26,619 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-28 03:17:26,619 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-28 03:17:26,620 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-28 03:17:26,621 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-28 03:17:26,626 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-28 03:17:26,629 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-28 03:17:26,634 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-28 03:17:26,634 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-28 03:17:26,635 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-28 03:17:26,636 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-28 03:17:26,636 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-28 03:17:26,637 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-28 03:17:26,637 INFO L290 TraceCheckUtils]: 113: Hoare triple {18479#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18483#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:17:26,637 INFO L290 TraceCheckUtils]: 114: Hoare triple {18483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18042#false} is VALID [2022-04-28 03:17:26,637 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-28 03:17:26,638 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-28 03:17:26,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:27,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598799635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:27,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:17:27,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 58 [2022-04-28 03:17:27,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927418196] [2022-04-28 03:17:27,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927418196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:27,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:27,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:17:27,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795490319] [2022-04-28 03:17:27,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:27,332 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-28 03:17:27,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:27,332 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-28 03:17:27,388 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-28 03:17:27,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:17:27,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:27,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:17:27,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3195, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:17:27,389 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-28 03:17:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:31,542 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2022-04-28 03:17:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:17:31,542 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-28 03:17:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:31,543 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-28 03:17:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-28 03:17:31,544 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-28 03:17:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-28 03:17:31,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 103 transitions. [2022-04-28 03:17:31,636 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-28 03:17:31,637 INFO L225 Difference]: With dead ends: 132 [2022-04-28 03:17:31,637 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 03:17:31,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 96 SyntacticMatches, 20 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=575, Invalid=7081, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:17:31,639 INFO L413 NwaCegarLoop]: 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-28 03:17:31,639 INFO L414 NwaCegarLoop]: 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-28 03:17:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 03:17:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-28 03:17:31,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:31,716 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-28 03:17:31,716 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-28 03:17:31,716 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-28 03:17:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:31,718 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-28 03:17:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-28 03:17:31,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:31,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:31,718 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-28 03:17:31,718 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-28 03:17:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:31,719 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-28 03:17:31,720 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-28 03:17:31,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:31,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:31,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:31,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:31,720 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-28 03:17:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-28 03:17:31,723 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2022-04-28 03:17:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:31,723 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-28 03:17:31,723 INFO L496 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-28 03:17:31,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-28 03:17:31,914 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-28 03:17:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-28 03:17:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 03:17:31,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:31,914 INFO L195 NwaCegarLoop]: 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-28 03:17:31,949 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-28 03:17:32,115 WARN L477 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-28 03:17:32,115 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:32,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 41 times [2022-04-28 03:17:32,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:32,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032972253] [2022-04-28 03:17:32,117 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:17:32,117 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:17:32,117 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:17:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 42 times [2022-04-28 03:17:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:32,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874460129] [2022-04-28 03:17:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:32,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,380 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-28 03:17:32,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-28 03:17:32,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 03:17:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,394 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-28 03:17:32,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 03:17:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,399 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-28 03:17:32,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:17:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,402 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-28 03:17:32,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 03:17:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,405 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-28 03:17:32,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 03:17:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,408 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-28 03:17:32,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:17:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,411 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-28 03:17:32,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-28 03:17:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,414 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-28 03:17:32,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-28 03:17:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,417 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-28 03:17:32,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-28 03:17:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,420 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-28 03:17:32,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-28 03:17:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,423 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-28 03:17:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-28 03:17:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,426 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-28 03:17:32,426 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-28 03:17:32,426 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-28 03:17:32,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-28 03:17:32,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-28 03:17:32,427 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-28 03:17:32,427 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-28 03:17:32,427 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-28 03:17:32,427 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-28 03:17:32,428 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-28 03:17:32,428 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-28 03:17:32,428 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-28 03:17:32,429 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-28 03:17:32,429 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-28 03:17:32,429 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-28 03:17:32,429 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-28 03:17:32,430 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-28 03:17:32,430 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-28 03:17:32,430 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-28 03:17:32,430 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-28 03:17:32,431 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-28 03:17:32,431 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-28 03:17:32,431 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-28 03:17:32,432 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-28 03:17:32,432 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-28 03:17:32,432 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-28 03:17:32,433 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-28 03:17:32,433 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-28 03:17:32,433 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-28 03:17:32,433 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-28 03:17:32,434 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-28 03:17:32,434 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-28 03:17:32,434 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-28 03:17:32,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,435 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-28 03:17:32,435 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-28 03:17:32,435 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-28 03:17:32,436 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-28 03:17:32,436 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-28 03:17:32,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,436 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-28 03:17:32,436 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-28 03:17:32,437 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-28 03:17:32,437 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-28 03:17:32,437 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-28 03:17:32,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,438 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-28 03:17:32,438 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-28 03:17:32,438 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-28 03:17:32,439 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-28 03:17:32,439 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-28 03:17:32,439 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,439 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-28 03:17:32,440 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-28 03:17:32,440 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-28 03:17:32,440 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-28 03:17:32,440 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-28 03:17:32,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,440 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,440 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,441 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-28 03:17:32,441 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-28 03:17:32,441 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-28 03:17:32,442 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-28 03:17:32,442 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-28 03:17:32,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,442 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,442 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,442 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-28 03:17:32,442 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-28 03:17:32,443 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-28 03:17:32,443 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-28 03:17:32,443 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-28 03:17:32,443 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,443 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,443 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,444 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-28 03:17:32,444 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-28 03:17:32,444 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-28 03:17:32,445 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-28 03:17:32,445 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-28 03:17:32,445 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,445 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,445 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,445 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-28 03:17:32,445 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-28 03:17:32,446 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-28 03:17:32,446 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-28 03:17:32,446 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-28 03:17:32,446 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,446 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,446 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,447 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-28 03:17:32,447 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-28 03:17:32,447 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-28 03:17:32,448 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-28 03:17:32,448 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-28 03:17:32,448 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,448 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,448 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,448 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-28 03:17:32,448 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-28 03:17:32,449 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-28 03:17:32,449 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-28 03:17:32,449 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-28 03:17:32,449 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:32,449 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:32,449 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:32,450 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-28 03:17:32,450 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-28 03:17:32,450 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-28 03:17:32,451 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-28 03:17:32,451 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-28 03:17:32,451 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-28 03:17:32,451 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-28 03:17:32,451 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-28 03:17:32,451 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-28 03:17:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:32,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874460129] [2022-04-28 03:17:32,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874460129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:32,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669947150] [2022-04-28 03:17:32,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:17:32,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:32,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:32,453 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-28 03:17:32,453 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-28 03:17:32,633 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 03:17:32,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:32,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:17:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:32,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:33,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-28 03:17:33,506 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-28 03:17:33,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-28 03:17:33,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-28 03:17:33,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-28 03:17:33,506 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-28 03:17:33,506 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-28 03:17:33,507 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-28 03:17:33,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-28 03:17:33,507 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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,510 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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,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-28 03:17:33,513 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-28 03:17:33,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-28 03:17:33,513 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-28 03:17:33,514 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-28 03:17:33,514 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-28 03:17:33,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,514 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-28 03:17:33,514 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-28 03:17:33,515 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-28 03:17:33,515 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-28 03:17:33,515 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-28 03:17:33,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,516 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-28 03:17:33,516 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-28 03:17:33,516 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-28 03:17:33,517 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-28 03:17:33,517 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-28 03:17:33,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,517 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-28 03:17:33,518 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-28 03:17:33,518 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-28 03:17:33,518 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-28 03:17:33,518 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-28 03:17:33,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,519 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-28 03:17:33,519 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-28 03:17:33,520 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-28 03:17:33,520 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-28 03:17:33,520 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-28 03:17:33,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,520 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-28 03:17:33,521 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-28 03:17:33,521 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-28 03:17:33,521 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-28 03:17:33,522 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-28 03:17:33,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,522 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-28 03:17:33,522 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-28 03:17:33,523 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-28 03:17:33,523 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-28 03:17:33,523 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-28 03:17:33,523 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,523 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,523 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,524 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-28 03:17:33,524 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-28 03:17:33,524 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-28 03:17:33,525 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-28 03:17:33,525 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-28 03:17:33,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,525 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,525 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,529 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-28 03:17:33,530 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-28 03:17:33,530 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-28 03:17:33,531 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-28 03:17:33,531 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-28 03:17:33,531 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,531 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,531 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,531 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-28 03:17:33,532 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-28 03:17:33,532 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-28 03:17:33,532 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-28 03:17:33,532 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-28 03:17:33,532 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,533 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,533 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,533 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-28 03:17:33,533 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-28 03:17:33,534 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-28 03:17:33,534 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-28 03:17:33,534 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-28 03:17:33,534 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:33,534 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:33,534 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:33,535 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-28 03:17:33,535 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-28 03:17:33,535 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-28 03:17:33,536 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-28 03:17:33,536 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-28 03:17:33,536 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-28 03:17:33,536 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-28 03:17:33,536 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-28 03:17:33,536 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-28 03:17:33,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:17:34,032 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-28 03:17:34,032 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-28 03:17:34,032 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-28 03:17:34,032 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-28 03:17:34,032 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-28 03:17:34,043 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-28 03:17:34,044 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-28 03:17:34,044 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-28 03:17:34,044 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,044 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,045 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,045 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-28 03:17:34,045 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-28 03:17:34,045 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-28 03:17:34,046 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-28 03:17:34,046 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-28 03:17:34,046 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,046 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,046 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,046 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-28 03:17:34,047 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-28 03:17:34,047 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-28 03:17:34,047 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-28 03:17:34,048 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-28 03:17:34,048 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,048 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,048 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,048 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-28 03:17:34,048 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-28 03:17:34,049 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-28 03:17:34,049 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-28 03:17:34,050 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-28 03:17:34,050 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,050 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,050 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,050 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-28 03:17:34,050 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-28 03:17:34,051 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-28 03:17:34,051 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-28 03:17:34,051 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-28 03:17:34,051 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,051 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,051 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,052 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-28 03:17:34,052 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-28 03:17:34,052 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-28 03:17:34,053 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-28 03:17:34,053 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-28 03:17:34,053 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,053 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,053 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,053 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-28 03:17:34,054 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-28 03:17:34,054 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-28 03:17:34,054 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-28 03:17:34,055 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-28 03:17:34,055 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,055 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,055 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,055 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-28 03:17:34,055 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-28 03:17:34,056 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-28 03:17:34,056 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-28 03:17:34,056 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-28 03:17:34,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,057 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-28 03:17:34,057 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-28 03:17:34,057 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-28 03:17:34,058 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-28 03:17:34,058 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-28 03:17:34,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,058 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-28 03:17:34,059 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-28 03:17:34,059 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-28 03:17:34,059 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-28 03:17:34,060 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-28 03:17:34,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,060 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-28 03:17:34,060 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-28 03:17:34,061 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-28 03:17:34,061 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-28 03:17:34,061 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-28 03:17:34,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 03:17:34,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 03:17:34,062 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-28 03:17:34,062 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-28 03:17:34,062 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-28 03:17:34,062 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-28 03:17:34,063 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-28 03:17:34,063 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-28 03:17:34,063 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-28 03:17:34,064 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-28 03:17:34,064 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-28 03:17:34,064 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-28 03:17:34,065 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-28 03:17:34,065 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-28 03:17:34,066 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-28 03:17:34,066 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-28 03:17:34,066 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-28 03:17:34,067 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-28 03:17:34,067 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-28 03:17:34,067 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-28 03:17:34,068 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-28 03:17:34,068 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-28 03:17:34,068 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-28 03:17:34,069 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-28 03:17:34,069 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-28 03:17:34,069 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-28 03:17:34,070 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-28 03:17:34,070 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-28 03:17:34,070 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-28 03:17:34,070 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-28 03:17:34,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-28 03:17:34,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-28 03:17:34,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 03:17:34,071 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-28 03:17:34,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-28 03:17:34,071 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-28 03:17:34,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669947150] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:17:34,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:17:34,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 42 [2022-04-28 03:17:34,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:17:34,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032972253] [2022-04-28 03:17:34,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032972253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:34,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:34,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 03:17:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700326434] [2022-04-28 03:17:34,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:17:34,072 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-28 03:17:34,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:17:34,073 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-28 03:17:34,130 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-28 03:17:34,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 03:17:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:34,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 03:17:34,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:17:34,131 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-28 03:17:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:35,173 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2022-04-28 03:17:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:17:35,173 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-28 03:17:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:17:35,173 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-28 03:17:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-28 03:17:35,175 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-28 03:17:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-28 03:17:35,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 113 transitions. [2022-04-28 03:17:35,261 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-28 03:17:35,263 INFO L225 Difference]: With dead ends: 186 [2022-04-28 03:17:35,263 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 03:17:35,264 INFO L412 NwaCegarLoop]: 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-28 03:17:35,264 INFO L413 NwaCegarLoop]: 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-28 03:17:35,264 INFO L414 NwaCegarLoop]: 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-28 03:17:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 03:17:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-04-28 03:17:35,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:17:35,345 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-28 03:17:35,346 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-28 03:17:35,346 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-28 03:17:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:35,347 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-28 03:17:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-28 03:17:35,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:35,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:35,348 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-28 03:17:35,348 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-28 03:17:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:17:35,357 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-28 03:17:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-28 03:17:35,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:17:35,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:17:35,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:17:35,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:17:35,358 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-28 03:17:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-04-28 03:17:35,359 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2022-04-28 03:17:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:17:35,360 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-04-28 03:17:35,360 INFO L496 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-28 03:17:35,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 130 transitions. [2022-04-28 03:17:35,555 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-28 03:17:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-28 03:17:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-28 03:17:35,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:17:35,556 INFO L195 NwaCegarLoop]: 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-28 03:17:35,573 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-28 03:17:35,756 WARN L477 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-28 03:17:35,756 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:17:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:17:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 43 times [2022-04-28 03:17:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:17:35,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429024135] [2022-04-28 03:17:35,759 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:17:35,760 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:17:35,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:17:35,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 44 times [2022-04-28 03:17:35,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:17:35,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640567800] [2022-04-28 03:17:35,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:17:35,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:17:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:17:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,235 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-28 03:17:36,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-28 03:17:36,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 03:17:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,238 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-28 03:17:36,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 03:17:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,241 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-28 03:17:36,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 03:17:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,244 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-28 03:17:36,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 03:17:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,246 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-28 03:17:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-28 03:17:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,257 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-28 03:17:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-28 03:17:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,260 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-28 03:17:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:17:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,263 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-28 03:17:36,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-28 03:17:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,267 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-28 03:17:36,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-28 03:17:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,270 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-28 03:17:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-28 03:17:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,272 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-28 03:17:36,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-28 03:17:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,275 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-28 03:17:36,276 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-28 03:17:36,276 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-28 03:17:36,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-28 03:17:36,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-28 03:17:36,276 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-28 03:17:36,276 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-28 03:17:36,276 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-28 03:17:36,277 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-28 03:17:36,277 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-28 03:17:36,277 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-28 03:17:36,278 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-28 03:17:36,278 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-28 03:17:36,279 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-28 03:17:36,279 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-28 03:17:36,279 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-28 03:17:36,280 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-28 03:17:36,280 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-28 03:17:36,280 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-28 03:17:36,281 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-28 03:17:36,281 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-28 03:17:36,281 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-28 03:17:36,282 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-28 03:17:36,282 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-28 03:17:36,282 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-28 03:17:36,283 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-28 03:17:36,283 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-28 03:17:36,283 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-28 03:17:36,284 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-28 03:17:36,284 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-28 03:17:36,285 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-28 03:17:36,285 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-28 03:17:36,285 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-28 03:17:36,286 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-28 03:17:36,286 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-28 03:17:36,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,286 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,286 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-28 03:17:36,286 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-28 03:17:36,287 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-28 03:17:36,287 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-28 03:17:36,287 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-28 03:17:36,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,288 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-28 03:17:36,288 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-28 03:17:36,289 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-28 03:17:36,289 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-28 03:17:36,289 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-28 03:17:36,289 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,289 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,290 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-28 03:17:36,290 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-28 03:17:36,290 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-28 03:17:36,291 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-28 03:17:36,291 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-28 03:17:36,291 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,291 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,291 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,291 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-28 03:17:36,292 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-28 03:17:36,292 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-28 03:17:36,292 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-28 03:17:36,292 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-28 03:17:36,292 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,292 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,293 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-28 03:17:36,293 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-28 03:17:36,294 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-28 03:17:36,294 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-28 03:17:36,294 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-28 03:17:36,294 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,294 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,294 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,295 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-28 03:17:36,295 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-28 03:17:36,295 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-28 03:17:36,296 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-28 03:17:36,296 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-28 03:17:36,296 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,296 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,296 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,296 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-28 03:17:36,296 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-28 03:17:36,297 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-28 03:17:36,297 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-28 03:17:36,297 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-28 03:17:36,297 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,297 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,297 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,298 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-28 03:17:36,298 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-28 03:17:36,299 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-28 03:17:36,299 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-28 03:17:36,299 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-28 03:17:36,299 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,299 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,299 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,299 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-28 03:17:36,300 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-28 03:17:36,300 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-28 03:17:36,300 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-28 03:17:36,301 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-28 03:17:36,301 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,301 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,301 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,301 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-28 03:17:36,301 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-28 03:17:36,302 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-28 03:17:36,302 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-28 03:17:36,302 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-28 03:17:36,302 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:17:36,302 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:17:36,302 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:17:36,303 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-28 03:17:36,303 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-28 03:17:36,304 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-28 03:17:36,304 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-28 03:17:36,304 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-28 03:17:36,305 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-28 03:17:36,305 INFO L290 TraceCheckUtils]: 124: Hoare triple {21198#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21122#false} is VALID [2022-04-28 03:17:36,305 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-28 03:17:36,305 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-28 03:17:36,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:36,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640567800] [2022-04-28 03:17:36,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640567800] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:17:36,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007855061] [2022-04-28 03:17:36,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:17:36,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:17:36,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:17:36,307 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-28 03:17:36,308 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-28 03:17:36,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:17:36,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:17:36,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 03:17:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:17:36,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:36,602 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-28 03:21:29,941 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-28 03:21:30,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-28 03:21:30,005 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-28 03:21:30,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:30,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-28 03:21:30,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-28 03:21:30,005 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-28 03:21:30,006 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-28 03:21:30,006 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-28 03:21:30,006 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-28 03:21:30,007 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-28 03:21:30,007 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-28 03:21:30,007 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-28 03:21:30,008 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-28 03:21:30,008 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-28 03:21:30,009 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-28 03:21:30,009 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-28 03:21:30,009 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-28 03:21:30,010 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-28 03:21:30,010 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-28 03:21:30,010 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-28 03:21:30,011 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-28 03:21:30,011 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-28 03:21:30,011 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-28 03:21:30,012 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-28 03:21:30,012 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-28 03:21:30,012 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-28 03:21:30,013 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-28 03:21:30,013 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-28 03:21:30,013 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-28 03:21:30,014 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-28 03:21:30,014 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-28 03:21:30,014 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-28 03:21:30,015 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-28 03:21:30,015 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-28 03:21:30,016 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-28 03:21:30,016 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-28 03:21:30,016 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-28 03:21:30,017 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-28 03:21:30,017 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-28 03:21:30,017 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-28 03:21:30,018 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-28 03:21:30,018 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-28 03:21:30,019 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-28 03:21:30,019 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-28 03:21:30,019 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-28 03:21:30,020 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-28 03:21:30,020 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-28 03:21:30,020 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-28 03:21:30,021 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-28 03:21:30,021 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-28 03:21:30,022 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-28 03:21:30,022 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-28 03:21:30,022 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-28 03:21:30,023 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-28 03:21:30,023 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-28 03:21:30,023 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-28 03:21:30,024 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-28 03:21:30,024 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-28 03:21:30,025 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-28 03:21:30,025 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-28 03:21:30,025 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-28 03:21:30,025 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-28 03:21:30,026 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-28 03:21:30,026 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-28 03:21:30,027 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-28 03:21:30,027 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-28 03:21:30,028 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-28 03:21:30,028 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-28 03:21:30,028 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-28 03:21:30,028 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-28 03:21:30,029 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-28 03:21:30,029 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-28 03:21:30,030 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-28 03:21:30,030 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-28 03:21:30,031 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-28 03:21:30,031 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-28 03:21:30,031 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-28 03:21:30,031 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-28 03:21:30,032 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-28 03:21:30,032 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-28 03:21:30,032 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-28 03:21:30,033 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-28 03:21:30,034 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-28 03:21:30,034 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-28 03:21:30,034 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-28 03:21:30,034 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-28 03:21:30,035 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-28 03:21:30,035 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-28 03:21:30,035 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-28 03:21:30,036 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-28 03:21:30,036 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-28 03:21:30,037 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-28 03:21:30,037 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-28 03:21:30,037 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-28 03:21:30,038 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-28 03:21:30,038 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-28 03:21:30,038 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-28 03:21:30,039 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-28 03:21:30,039 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-28 03:21:30,040 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-28 03:21:30,040 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-28 03:21:30,040 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-28 03:21:30,041 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-28 03:21:30,041 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-28 03:21:30,041 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-28 03:21:30,042 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-28 03:21:30,042 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-28 03:21:30,043 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-28 03:21:30,043 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-28 03:21:30,043 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-28 03:21:30,044 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-28 03:21:30,044 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-28 03:21:30,044 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-28 03:21:30,045 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-28 03:21:30,045 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-28 03:21:30,046 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-28 03:21:30,046 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-28 03:21:30,046 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-28 03:21:30,046 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-28 03:21:30,047 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-28 03:21:30,047 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-28 03:21:30,048 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-28 03:21:30,048 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-28 03:21:30,048 INFO L290 TraceCheckUtils]: 123: Hoare triple {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:21:30,048 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-28 03:21:30,049 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-28 03:21:30,049 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-28 03:21:30,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:21:32,389 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-28 03:21:32,392 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-28 03:21:32,555 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-28 03:21:32,556 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-28 03:21:32,556 INFO L290 TraceCheckUtils]: 123: Hoare triple {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:21:32,556 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-28 03:21:32,557 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-28 03:21:32,557 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-28 03:21:32,558 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-28 03:21:32,558 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-28 03:21:32,558 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,558 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,558 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,558 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-28 03:21:32,559 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-28 03:21:32,559 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-28 03:21:32,559 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-28 03:21:32,560 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-28 03:21:32,560 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,560 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,560 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,560 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-28 03:21:32,560 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-28 03:21:32,561 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-28 03:21:32,561 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-28 03:21:32,562 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-28 03:21:32,562 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,562 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,562 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,562 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-28 03:21:32,562 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-28 03:21:32,563 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-28 03:21:32,563 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-28 03:21:32,563 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-28 03:21:32,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,564 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,564 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,564 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-28 03:21:32,564 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-28 03:21:32,565 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-28 03:21:32,565 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-28 03:21:32,565 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-28 03:21:32,565 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,565 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,565 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,566 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-28 03:21:32,566 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-28 03:21:32,566 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-28 03:21:32,567 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-28 03:21:32,567 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-28 03:21:32,567 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,567 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,567 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-28 03:21:32,567 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-28 03:21:32,568 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-28 03:21:32,568 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-28 03:21:32,569 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-28 03:21:32,569 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,569 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,569 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,569 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-28 03:21:32,569 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-28 03:21:32,570 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-28 03:21:32,570 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-28 03:21:32,571 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-28 03:21:32,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,571 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-28 03:21:32,571 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-28 03:21:32,572 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-28 03:21:32,572 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-28 03:21:32,572 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-28 03:21:32,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,573 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-28 03:21:32,573 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-28 03:21:32,574 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-28 03:21:32,574 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-28 03:21:32,574 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-28 03:21:32,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,575 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-28 03:21:32,575 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-28 03:21:32,575 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-28 03:21:32,576 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-28 03:21:32,576 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-28 03:21:32,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 03:21:32,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 03:21:32,576 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-28 03:21:32,577 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-28 03:21:32,577 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-28 03:21:32,577 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-28 03:21:32,578 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-28 03:21:32,578 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-28 03:21:32,579 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-28 03:21:32,579 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-28 03:21:32,579 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-28 03:21:32,580 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-28 03:21:32,580 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-28 03:21:32,580 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-28 03:21:32,581 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-28 03:21:32,581 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-28 03:21:32,581 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-28 03:21:32,582 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-28 03:21:32,582 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-28 03:21:32,582 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-28 03:21:32,583 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-28 03:21:32,583 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-28 03:21:32,584 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-28 03:21:32,584 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-28 03:21:32,584 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-28 03:21:32,585 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-28 03:21:32,585 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-28 03:21:32,585 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-28 03:21:32,586 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-28 03:21:32,586 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-28 03:21:32,586 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-28 03:21:32,586 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-28 03:21:32,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-28 03:21:32,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-28 03:21:32,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 03:21:32,586 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-28 03:21:32,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-28 03:21:32,587 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-28 03:21:32,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007855061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:21:32,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:21:32,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 30] total 47 [2022-04-28 03:21:32,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:32,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429024135] [2022-04-28 03:21:32,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429024135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:32,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:32,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:21:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166350510] [2022-04-28 03:21:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:32,588 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-28 03:21:32,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:32,588 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-28 03:21:32,649 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-28 03:21:32,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:21:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:32,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:21:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2017, Unknown=12, NotChecked=0, Total=2162 [2022-04-28 03:21:32,650 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-28 03:21:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:37,464 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-04-28 03:21:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:21:37,464 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-28 03:21:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:37,465 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-28 03:21:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-28 03:21:37,466 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-28 03:21:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-28 03:21:37,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 110 transitions. [2022-04-28 03:21:37,567 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-28 03:21:37,568 INFO L225 Difference]: With dead ends: 142 [2022-04-28 03:21:37,568 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 03:21:37,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 235 SyntacticMatches, 26 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 235.0s TimeCoverageRelationStatistics Valid=304, Invalid=5536, Unknown=12, NotChecked=0, Total=5852 [2022-04-28 03:21:37,569 INFO L413 NwaCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:37,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 172 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 03:21:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 03:21:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2022-04-28 03:21:37,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:37,650 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-28 03:21:37,650 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-28 03:21:37,650 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-28 03:21:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:37,651 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-28 03:21:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-28 03:21:37,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:37,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:37,652 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-28 03:21:37,652 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-28 03:21:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:37,653 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-28 03:21:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-28 03:21:37,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:37,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:37,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:37,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:37,654 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-28 03:21:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2022-04-28 03:21:37,655 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2022-04-28 03:21:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:37,655 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2022-04-28 03:21:37,655 INFO L496 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-28 03:21:37,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 138 transitions. [2022-04-28 03:21:37,879 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-28 03:21:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-28 03:21:37,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 03:21:37,889 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:37,890 INFO L195 NwaCegarLoop]: 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-28 03:21:37,909 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-28 03:21:38,096 WARN L477 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-28 03:21:38,096 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:38,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 45 times [2022-04-28 03:21:38,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:38,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592209567] [2022-04-28 03:21:38,098 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:21:38,098 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:21:38,098 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:21:38,098 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 46 times [2022-04-28 03:21:38,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:38,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431848733] [2022-04-28 03:21:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:38,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,431 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-28 03:21:38,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-28 03:21:38,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 03:21:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,434 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-28 03:21:38,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 03:21:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,439 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-28 03:21:38,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 03:21:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,441 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-28 03:21:38,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 03:21:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,457 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-28 03:21:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-28 03:21:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,462 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-28 03:21:38,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-28 03:21:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,465 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-28 03:21:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 03:21:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,472 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-28 03:21:38,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-28 03:21:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,476 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-28 03:21:38,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-28 03:21:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,479 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-28 03:21:38,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-28 03:21:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,482 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-28 03:21:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-28 03:21:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,485 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-28 03:21:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-28 03:21:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,487 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-28 03:21:38,488 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-28 03:21:38,488 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-28 03:21:38,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-28 03:21:38,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-28 03:21:38,488 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-28 03:21:38,488 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-28 03:21:38,488 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-28 03:21:38,489 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-28 03:21:38,489 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-28 03:21:38,489 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-28 03:21:38,490 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-28 03:21:38,490 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-28 03:21:38,490 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-28 03:21:38,490 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-28 03:21:38,491 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-28 03:21:38,491 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-28 03:21:38,491 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-28 03:21:38,492 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-28 03:21:38,492 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-28 03:21:38,492 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-28 03:21:38,492 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-28 03:21:38,493 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-28 03:21:38,493 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-28 03:21:38,493 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-28 03:21:38,493 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-28 03:21:38,494 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-28 03:21:38,494 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-28 03:21:38,494 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-28 03:21:38,494 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-28 03:21:38,495 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-28 03:21:38,495 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-28 03:21:38,495 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-28 03:21:38,496 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-28 03:21:38,496 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-28 03:21:38,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,496 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-28 03:21:38,497 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-28 03:21:38,497 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-28 03:21:38,497 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-28 03:21:38,497 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-28 03:21:38,497 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,498 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-28 03:21:38,498 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-28 03:21:38,498 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-28 03:21:38,498 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-28 03:21:38,499 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-28 03:21:38,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,499 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,499 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-28 03:21:38,499 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-28 03:21:38,500 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-28 03:21:38,500 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-28 03:21:38,500 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-28 03:21:38,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,500 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,500 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-28 03:21:38,501 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-28 03:21:38,501 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-28 03:21:38,501 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-28 03:21:38,501 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-28 03:21:38,501 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,502 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-28 03:21:38,502 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-28 03:21:38,502 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-28 03:21:38,503 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-28 03:21:38,503 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-28 03:21:38,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,503 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,503 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,503 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-28 03:21:38,503 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-28 03:21:38,504 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-28 03:21:38,504 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-28 03:21:38,504 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-28 03:21:38,504 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,504 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,504 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,505 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-28 03:21:38,505 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-28 03:21:38,505 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-28 03:21:38,505 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-28 03:21:38,505 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-28 03:21:38,505 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,505 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,506 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,506 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-28 03:21:38,506 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-28 03:21:38,506 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-28 03:21:38,507 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-28 03:21:38,507 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-28 03:21:38,507 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,507 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,507 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,507 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-28 03:21:38,507 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-28 03:21:38,508 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-28 03:21:38,508 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-28 03:21:38,508 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-28 03:21:38,508 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,508 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,508 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,509 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-28 03:21:38,509 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-28 03:21:38,509 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-28 03:21:38,510 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-28 03:21:38,510 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-28 03:21:38,510 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,510 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,510 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,510 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-28 03:21:38,510 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-28 03:21:38,511 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-28 03:21:38,511 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-28 03:21:38,511 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-28 03:21:38,511 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:38,511 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:38,511 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:38,511 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-28 03:21:38,512 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-28 03:21:38,512 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-28 03:21:38,512 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-28 03:21:38,512 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-28 03:21:38,512 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-28 03:21:38,512 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-28 03:21:38,512 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-28 03:21:38,513 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-28 03:21:38,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:38,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431848733] [2022-04-28 03:21:38,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431848733] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:21:38,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15609887] [2022-04-28 03:21:38,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:21:38,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:21:38,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:21:38,525 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-28 03:21:38,537 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-28 03:21:38,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:21:38,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:21:38,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:21:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:38,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:21:39,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-28 03:21:39,855 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-28 03:21:39,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-28 03:21:39,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-28 03:21:39,855 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-28 03:21:39,856 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-28 03:21:39,856 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-28 03:21:39,856 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-28 03:21:39,856 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-28 03:21:39,857 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-28 03:21:39,857 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-28 03:21:39,857 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-28 03:21:39,858 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-28 03:21:39,858 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-28 03:21:39,858 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-28 03:21:39,859 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-28 03:21:39,859 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-28 03:21:39,859 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-28 03:21:39,859 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-28 03:21:39,860 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-28 03:21:39,860 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-28 03:21:39,860 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-28 03:21:39,860 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-28 03:21:39,861 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-28 03:21:39,861 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-28 03:21:39,861 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-28 03:21:39,862 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-28 03:21:39,862 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-28 03:21:39,862 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-28 03:21:39,862 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-28 03:21:39,863 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-28 03:21:39,863 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-28 03:21:39,863 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-28 03:21:39,864 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-28 03:21:39,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,864 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-28 03:21:39,864 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-28 03:21:39,865 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-28 03:21:39,865 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-28 03:21:39,865 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-28 03:21:39,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,866 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-28 03:21:39,866 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-28 03:21:39,866 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-28 03:21:39,867 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-28 03:21:39,867 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-28 03:21:39,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,867 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-28 03:21:39,868 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-28 03:21:39,868 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-28 03:21:39,868 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-28 03:21:39,868 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-28 03:21:39,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,872 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-28 03:21:39,872 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-28 03:21:39,872 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-28 03:21:39,873 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-28 03:21:39,873 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-28 03:21:39,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,873 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,873 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-28 03:21:39,874 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-28 03:21:39,874 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-28 03:21:39,874 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-28 03:21:39,875 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-28 03:21:39,875 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,875 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,875 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,875 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-28 03:21:39,875 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-28 03:21:39,876 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-28 03:21:39,876 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-28 03:21:39,876 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-28 03:21:39,876 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,876 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,876 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,877 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-28 03:21:39,877 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-28 03:21:39,877 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-28 03:21:39,878 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-28 03:21:39,878 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-28 03:21:39,878 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,878 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,878 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-28 03:21:39,879 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-28 03:21:39,879 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-28 03:21:39,879 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-28 03:21:39,879 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-28 03:21:39,880 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,880 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,880 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,880 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-28 03:21:39,880 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-28 03:21:39,881 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-28 03:21:39,881 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-28 03:21:39,881 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-28 03:21:39,881 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,881 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,881 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,882 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-28 03:21:39,882 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-28 03:21:39,882 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-28 03:21:39,883 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-28 03:21:39,883 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-28 03:21:39,883 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,883 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,883 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,883 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-28 03:21:39,883 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-28 03:21:39,884 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-28 03:21:39,884 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-28 03:21:39,884 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-28 03:21:39,884 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:39,884 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:39,884 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:39,885 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-28 03:21:39,885 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-28 03:21:39,885 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-28 03:21:39,886 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-28 03:21:39,886 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-28 03:21:39,886 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-28 03:21:39,886 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-28 03:21:39,886 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-28 03:21:39,886 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-28 03:21:39,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:21:40,456 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-28 03:21:40,457 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-28 03:21:40,457 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-28 03:21:40,467 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-28 03:21:40,472 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-28 03:21:40,473 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-28 03:21:40,473 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-28 03:21:40,473 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-28 03:21:40,473 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,473 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,474 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,474 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-28 03:21:40,474 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-28 03:21:40,474 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-28 03:21:40,474 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-28 03:21:40,475 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-28 03:21:40,475 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,475 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,475 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,475 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-28 03:21:40,475 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-28 03:21:40,476 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-28 03:21:40,476 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-28 03:21:40,476 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-28 03:21:40,476 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,477 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,477 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,477 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-28 03:21:40,477 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-28 03:21:40,477 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-28 03:21:40,478 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-28 03:21:40,478 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-28 03:21:40,478 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,478 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,478 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,478 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-28 03:21:40,478 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-28 03:21:40,479 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-28 03:21:40,479 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-28 03:21:40,479 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-28 03:21:40,479 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,480 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,480 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,480 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-28 03:21:40,480 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-28 03:21:40,480 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-28 03:21:40,481 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-28 03:21:40,481 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-28 03:21:40,481 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,481 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,481 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,481 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-28 03:21:40,481 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-28 03:21:40,482 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-28 03:21:40,482 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-28 03:21:40,482 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-28 03:21:40,482 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,483 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,483 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-28 03:21:40,491 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-28 03:21:40,491 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-28 03:21:40,491 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-28 03:21:40,492 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-28 03:21:40,492 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,492 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,492 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,492 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-28 03:21:40,492 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-28 03:21:40,493 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-28 03:21:40,493 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-28 03:21:40,494 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-28 03:21:40,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,494 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,494 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,494 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-28 03:21:40,494 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-28 03:21:40,494 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-28 03:21:40,495 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-28 03:21:40,495 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-28 03:21:40,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,495 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-28 03:21:40,496 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-28 03:21:40,496 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-28 03:21:40,496 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-28 03:21:40,497 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-28 03:21:40,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,497 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,497 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-28 03:21:40,497 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-28 03:21:40,498 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-28 03:21:40,498 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-28 03:21:40,498 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-28 03:21:40,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 03:21:40,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 03:21:40,498 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-28 03:21:40,499 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-28 03:21:40,499 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-28 03:21:40,499 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-28 03:21:40,500 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-28 03:21:40,500 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-28 03:21:40,500 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-28 03:21:40,501 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-28 03:21:40,501 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-28 03:21:40,501 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-28 03:21:40,502 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-28 03:21:40,502 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-28 03:21:40,502 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-28 03:21:40,503 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-28 03:21:40,503 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-28 03:21:40,503 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-28 03:21:40,503 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-28 03:21:40,504 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-28 03:21:40,504 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-28 03:21:40,504 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-28 03:21:40,505 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-28 03:21:40,505 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-28 03:21:40,505 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-28 03:21:40,506 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-28 03:21:40,506 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-28 03:21:40,506 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-28 03:21:40,507 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-28 03:21:40,507 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-28 03:21:40,507 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-28 03:21:40,508 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-28 03:21:40,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-28 03:21:40,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-28 03:21:40,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 03:21:40,508 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-28 03:21:40,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-28 03:21:40,508 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-28 03:21:40,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15609887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:21:40,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:21:40,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 45 [2022-04-28 03:21:40,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:40,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592209567] [2022-04-28 03:21:40,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592209567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:40,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:40,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:21:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353217371] [2022-04-28 03:21:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:40,509 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-28 03:21:40,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:40,510 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-28 03:21:40,572 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-28 03:21:40,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:21:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:21:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:21:40,573 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-28 03:21:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:41,912 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2022-04-28 03:21:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:21:41,912 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-28 03:21:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:41,913 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-28 03:21:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-28 03:21:41,914 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-28 03:21:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-28 03:21:41,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 120 transitions. [2022-04-28 03:21:42,005 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-28 03:21:42,007 INFO L225 Difference]: With dead ends: 200 [2022-04-28 03:21:42,007 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 03:21:42,008 INFO L412 NwaCegarLoop]: 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-28 03:21:42,008 INFO L413 NwaCegarLoop]: 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-28 03:21:42,008 INFO L414 NwaCegarLoop]: 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-28 03:21:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 03:21:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-04-28 03:21:42,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:42,091 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-28 03:21:42,091 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-28 03:21:42,091 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-28 03:21:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:42,092 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-28 03:21:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-28 03:21:42,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:42,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:42,093 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-28 03:21:42,093 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-28 03:21:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:42,094 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-28 03:21:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-28 03:21:42,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:42,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:42,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:42,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:42,095 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-28 03:21:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-04-28 03:21:42,097 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2022-04-28 03:21:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:42,097 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-04-28 03:21:42,097 INFO L496 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-28 03:21:42,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 140 transitions. [2022-04-28 03:21:42,324 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-28 03:21:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-04-28 03:21:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 03:21:42,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:42,325 INFO L195 NwaCegarLoop]: 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-28 03:21:42,354 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-28 03:21:42,525 WARN L477 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-28 03:21:42,526 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:42,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 47 times [2022-04-28 03:21:42,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:42,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195067916] [2022-04-28 03:21:42,528 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:21:42,528 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:21:42,528 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:21:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 48 times [2022-04-28 03:21:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:42,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590573133] [2022-04-28 03:21:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:42,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,278 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-28 03:21:43,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-28 03:21:43,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 03:21:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,293 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-28 03:21:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 03:21:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,296 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-28 03:21:43,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 03:21:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,299 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-28 03:21:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:21:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,302 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-28 03:21:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 03:21:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,305 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-28 03:21:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 03:21:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,308 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-28 03:21:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-28 03:21:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,327 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-28 03:21:43,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-28 03:21:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,331 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-28 03:21:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 03:21:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,334 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-28 03:21:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-28 03:21:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,337 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-28 03:21:43,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-28 03:21:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,342 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-28 03:21:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-28 03:21:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,349 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-28 03:21:43,350 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-28 03:21:43,350 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-28 03:21:43,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-28 03:21:43,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-28 03:21:43,350 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-28 03:21:43,350 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-28 03:21:43,351 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-28 03:21:43,351 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-28 03:21:43,351 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-28 03:21:43,352 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-28 03:21:43,352 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-28 03:21:43,352 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-28 03:21:43,353 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-28 03:21:43,353 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-28 03:21:43,353 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-28 03:21:43,354 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-28 03:21:43,354 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-28 03:21:43,354 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-28 03:21:43,355 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-28 03:21:43,355 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-28 03:21:43,355 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-28 03:21:43,356 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-28 03:21:43,356 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-28 03:21:43,356 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-28 03:21:43,357 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-28 03:21:43,357 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-28 03:21:43,357 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-28 03:21:43,358 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-28 03:21:43,358 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-28 03:21:43,359 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-28 03:21:43,359 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-28 03:21:43,360 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-28 03:21:43,360 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-28 03:21:43,360 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-28 03:21:43,360 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-28 03:21:43,361 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-28 03:21:43,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,361 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-28 03:21:43,361 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-28 03:21:43,362 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-28 03:21:43,362 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-28 03:21:43,362 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-28 03:21:43,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,363 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-28 03:21:43,363 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-28 03:21:43,363 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-28 03:21:43,364 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-28 03:21:43,364 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-28 03:21:43,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,364 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-28 03:21:43,365 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-28 03:21:43,365 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-28 03:21:43,365 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-28 03:21:43,365 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-28 03:21:43,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,366 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-28 03:21:43,366 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-28 03:21:43,367 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-28 03:21:43,367 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-28 03:21:43,367 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-28 03:21:43,367 INFO L290 TraceCheckUtils]: 69: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,367 INFO L290 TraceCheckUtils]: 70: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,367 INFO L290 TraceCheckUtils]: 71: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,368 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-28 03:21:43,368 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-28 03:21:43,368 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-28 03:21:43,369 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-28 03:21:43,369 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-28 03:21:43,369 INFO L290 TraceCheckUtils]: 77: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,369 INFO L290 TraceCheckUtils]: 78: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,369 INFO L290 TraceCheckUtils]: 79: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,369 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-28 03:21:43,370 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-28 03:21:43,370 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-28 03:21:43,370 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-28 03:21:43,370 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-28 03:21:43,370 INFO L290 TraceCheckUtils]: 85: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,371 INFO L290 TraceCheckUtils]: 86: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,371 INFO L290 TraceCheckUtils]: 87: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,371 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-28 03:21:43,371 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-28 03:21:43,372 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-28 03:21:43,372 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-28 03:21:43,372 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-28 03:21:43,372 INFO L290 TraceCheckUtils]: 93: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,372 INFO L290 TraceCheckUtils]: 94: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,372 INFO L290 TraceCheckUtils]: 95: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,373 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-28 03:21:43,373 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-28 03:21:43,373 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-28 03:21:43,374 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-28 03:21:43,374 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-28 03:21:43,374 INFO L290 TraceCheckUtils]: 101: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,374 INFO L290 TraceCheckUtils]: 102: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,374 INFO L290 TraceCheckUtils]: 103: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,374 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-28 03:21:43,375 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-28 03:21:43,375 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-28 03:21:43,375 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-28 03:21:43,375 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-28 03:21:43,375 INFO L290 TraceCheckUtils]: 109: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,375 INFO L290 TraceCheckUtils]: 110: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,376 INFO L290 TraceCheckUtils]: 111: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,376 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-28 03:21:43,376 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-28 03:21:43,377 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-28 03:21:43,377 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-28 03:21:43,377 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-28 03:21:43,377 INFO L290 TraceCheckUtils]: 117: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,377 INFO L290 TraceCheckUtils]: 118: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,377 INFO L290 TraceCheckUtils]: 119: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,378 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-28 03:21:43,378 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-28 03:21:43,378 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-28 03:21:43,379 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-28 03:21:43,379 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-28 03:21:43,379 INFO L290 TraceCheckUtils]: 125: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 03:21:43,379 INFO L290 TraceCheckUtils]: 126: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 03:21:43,379 INFO L290 TraceCheckUtils]: 127: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:43,379 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-28 03:21:43,379 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-28 03:21:43,380 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-28 03:21:43,380 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-28 03:21:43,381 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-28 03:21:43,381 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-28 03:21:43,381 INFO L290 TraceCheckUtils]: 134: Hoare triple {24862#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24780#false} is VALID [2022-04-28 03:21:43,381 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-28 03:21:43,382 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-28 03:21:43,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590573133] [2022-04-28 03:21:43,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590573133] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:21:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205768273] [2022-04-28 03:21:43,382 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:21:43,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:21:43,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:21:43,383 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-28 03:21:43,386 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-28 03:21:43,687 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-28 03:21:43,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:21:43,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 03:21:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:43,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:21:44,121 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-28 03:21:54,000 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:21:54,001 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-28 03:21:54,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {24779#true} call ULTIMATE.init(); {24779#true} is VALID [2022-04-28 03:21:54,100 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-28 03:21:54,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 03:21:54,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-28 03:21:54,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-28 03:21:54,100 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-28 03:21:54,100 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-28 03:21:54,100 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-28 03:21:54,101 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-28 03:21:54,101 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-28 03:21:54,101 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-28 03:21:54,102 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-28 03:21:54,102 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-28 03:21:54,102 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-28 03:21:54,103 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-28 03:21:54,103 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-28 03:21:54,103 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-28 03:21:54,103 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-28 03:21:54,104 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-28 03:21:54,104 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-28 03:21:54,104 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-28 03:21:54,104 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-28 03:21:54,105 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-28 03:21:54,105 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-28 03:21:54,105 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-28 03:21:54,106 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-28 03:21:54,106 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-28 03:21:54,106 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-28 03:21:54,107 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-28 03:21:54,107 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-28 03:21:54,107 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-28 03:21:54,108 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-28 03:21:54,109 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-28 03:21:54,109 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-28 03:21:54,110 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-28 03:21:54,110 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-28 03:21:54,112 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-28 03:21:54,112 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-28 03:21:54,113 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-28 03:21:54,113 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-28 03:21:54,113 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-28 03:21:54,114 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-28 03:21:54,114 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-28 03:21:54,115 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-28 03:21:54,118 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-28 03:21:54,118 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-28 03:21:54,118 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-28 03:21:54,118 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-28 03:21:54,119 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-28 03:21:54,119 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-28 03:21:54,120 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-28 03:21:54,120 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-28 03:21:54,131 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-28 03:21:54,131 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-28 03:21:54,131 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-28 03:21:54,132 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-28 03:21:54,132 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-28 03:21:54,133 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-28 03:21:54,133 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-28 03:21:54,134 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-28 03:21:54,136 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-28 03:21:54,136 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-28 03:21:54,136 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-28 03:21:54,137 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-28 03:21:54,137 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-28 03:21:54,138 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-28 03:21:54,138 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-28 03:21:54,139 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-28 03:21:54,144 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-28 03:21:54,144 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-28 03:21:54,144 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-28 03:21:54,145 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-28 03:21:54,145 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-28 03:21:54,146 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-28 03:21:54,146 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-28 03:21:54,147 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-28 03:21:54,149 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-28 03:21:54,149 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-28 03:21:54,150 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-28 03:21:54,150 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-28 03:21:54,150 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-28 03:21:54,151 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-28 03:21:54,151 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-28 03:21:54,152 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-28 03:21:54,201 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-28 03:21:54,201 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-28 03:21:54,201 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-28 03:21:54,202 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-28 03:21:54,202 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-28 03:21:54,203 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-28 03:21:54,203 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-28 03:21:54,204 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-28 03:21:54,206 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-28 03:21:54,207 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-28 03:21:54,207 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-28 03:21:54,207 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-28 03:21:54,208 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-28 03:21:54,208 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-28 03:21:54,209 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-28 03:21:54,209 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-28 03:21:54,211 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-28 03:21:54,212 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-28 03:21:54,212 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-28 03:21:54,212 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-28 03:21:54,213 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-28 03:21:54,213 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-28 03:21:54,214 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-28 03:21:54,214 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-28 03:21:54,219 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-28 03:21:54,220 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-28 03:21:54,220 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-28 03:21:54,220 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-28 03:21:54,221 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-28 03:21:54,221 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-28 03:21:54,222 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-28 03:21:54,222 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-28 03:21:54,225 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-28 03:21:54,226 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-28 03:21:54,226 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-28 03:21:54,226 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-28 03:21:54,227 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-28 03:21:54,227 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-28 03:21:54,228 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-28 03:21:54,228 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-28 03:21:54,236 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-28 03:21:54,237 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-28 03:21:54,237 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-28 03:21:54,237 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-28 03:21:54,238 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-28 03:21:54,238 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-28 03:21:54,239 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-28 03:21:54,239 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-28 03:21:54,240 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-28 03:21:54,240 INFO L290 TraceCheckUtils]: 133: Hoare triple {25293#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:21:54,240 INFO L290 TraceCheckUtils]: 134: Hoare triple {25297#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24780#false} is VALID [2022-04-28 03:21:54,240 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-28 03:21:54,241 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-28 03:21:54,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:21:54,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205768273] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:21:54,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:21:54,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 66 [2022-04-28 03:21:54,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:54,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195067916] [2022-04-28 03:21:54,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195067916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:54,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:54,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:21:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000880704] [2022-04-28 03:21:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:54,545 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-28 03:21:54,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:54,546 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-28 03:21:54,629 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-28 03:21:54,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:21:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:21:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=4106, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 03:21:54,630 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-28 03:22:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:00,408 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2022-04-28 03:22:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:22:00,408 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-28 03:22:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:00,408 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-28 03:22:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-28 03:22:00,410 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-28 03:22:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-28 03:22:00,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 117 transitions. [2022-04-28 03:22:00,523 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-28 03:22:00,525 INFO L225 Difference]: With dead ends: 152 [2022-04-28 03:22:00,525 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 03:22:00,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 112 SyntacticMatches, 24 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3282 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=727, Invalid=9173, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:22:00,526 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3192 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:00,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 183 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3192 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:22:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 03:22:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-04-28 03:22:00,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:00,672 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-28 03:22:00,672 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-28 03:22:00,672 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-28 03:22:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:00,674 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-28 03:22:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-28 03:22:00,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:00,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:00,675 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-28 03:22:00,675 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-28 03:22:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:00,677 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-28 03:22:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-28 03:22:00,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:00,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:00,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:00,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:00,678 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-28 03:22:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-04-28 03:22:00,680 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2022-04-28 03:22:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:00,680 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-04-28 03:22:00,680 INFO L496 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-28 03:22:00,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 148 transitions. [2022-04-28 03:22:00,917 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-28 03:22:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-04-28 03:22:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-28 03:22:00,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:00,917 INFO L195 NwaCegarLoop]: 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-28 03:22:00,935 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-28 03:22:01,118 WARN L477 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-28 03:22:01,118 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:01,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 49 times [2022-04-28 03:22:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:01,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [518546976] [2022-04-28 03:22:01,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:22:01,121 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:22:01,121 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:22:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 50 times [2022-04-28 03:22:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:01,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078015190] [2022-04-28 03:22:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:01,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,471 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-28 03:22:01,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-28 03:22:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 03:22:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,474 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-28 03:22:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 03:22:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,489 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-28 03:22:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 03:22:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,492 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-28 03:22:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 03:22:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,494 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-28 03:22:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 03:22:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,497 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-28 03:22:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 03:22:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,500 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-28 03:22:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-28 03:22:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,503 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-28 03:22:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-28 03:22:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,506 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-28 03:22:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 03:22:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,509 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-28 03:22:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-28 03:22:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,512 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-28 03:22:01,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-28 03:22:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,515 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-28 03:22:01,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-28 03:22:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,518 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-28 03:22:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-04-28 03:22:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,521 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-28 03:22:01,521 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-28 03:22:01,521 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-28 03:22:01,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-28 03:22:01,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {26291#true} call #t~ret6 := main(); {26291#true} is VALID [2022-04-28 03:22:01,522 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-28 03:22:01,522 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-28 03:22:01,522 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-28 03:22:01,522 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-28 03:22:01,522 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-28 03:22:01,523 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-28 03:22:01,523 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-28 03:22:01,523 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-28 03:22:01,524 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-28 03:22:01,524 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-28 03:22:01,524 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-28 03:22:01,524 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-28 03:22:01,525 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-28 03:22:01,525 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-28 03:22:01,525 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-28 03:22:01,525 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-28 03:22:01,526 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-28 03:22:01,526 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-28 03:22:01,526 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-28 03:22:01,526 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-28 03:22:01,527 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-28 03:22:01,527 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-28 03:22:01,527 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-28 03:22:01,527 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-28 03:22:01,528 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-28 03:22:01,528 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-28 03:22:01,528 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-28 03:22:01,528 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-28 03:22:01,529 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-28 03:22:01,529 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-28 03:22:01,529 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-28 03:22:01,529 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-28 03:22:01,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,530 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-28 03:22:01,530 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-28 03:22:01,530 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-28 03:22:01,531 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-28 03:22:01,531 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-28 03:22:01,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,531 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-28 03:22:01,531 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-28 03:22:01,532 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-28 03:22:01,532 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-28 03:22:01,532 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-28 03:22:01,532 INFO L290 TraceCheckUtils]: 53: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,532 INFO L290 TraceCheckUtils]: 54: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,532 INFO L290 TraceCheckUtils]: 55: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,533 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-28 03:22:01,533 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-28 03:22:01,533 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-28 03:22:01,533 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-28 03:22:01,533 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-28 03:22:01,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,534 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-28 03:22:01,534 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-28 03:22:01,534 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-28 03:22:01,535 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-28 03:22:01,535 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-28 03:22:01,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,535 INFO L290 TraceCheckUtils]: 70: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,535 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-28 03:22:01,535 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-28 03:22:01,536 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-28 03:22:01,536 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-28 03:22:01,536 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-28 03:22:01,536 INFO L290 TraceCheckUtils]: 77: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,536 INFO L290 TraceCheckUtils]: 78: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,536 INFO L290 TraceCheckUtils]: 79: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,537 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-28 03:22:01,537 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-28 03:22:01,537 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-28 03:22:01,537 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-28 03:22:01,537 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-28 03:22:01,537 INFO L290 TraceCheckUtils]: 85: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,538 INFO L290 TraceCheckUtils]: 86: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,538 INFO L290 TraceCheckUtils]: 87: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,538 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-28 03:22:01,538 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-28 03:22:01,538 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-28 03:22:01,539 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-28 03:22:01,539 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-28 03:22:01,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,539 INFO L290 TraceCheckUtils]: 94: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,539 INFO L290 TraceCheckUtils]: 95: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,539 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-28 03:22:01,540 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-28 03:22:01,540 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-28 03:22:01,540 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-28 03:22:01,540 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-28 03:22:01,540 INFO L290 TraceCheckUtils]: 101: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,540 INFO L290 TraceCheckUtils]: 102: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,540 INFO L290 TraceCheckUtils]: 103: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,541 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-28 03:22:01,541 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-28 03:22:01,541 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-28 03:22:01,541 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-28 03:22:01,542 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-28 03:22:01,542 INFO L290 TraceCheckUtils]: 109: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,542 INFO L290 TraceCheckUtils]: 110: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,542 INFO L290 TraceCheckUtils]: 111: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,542 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-28 03:22:01,542 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-28 03:22:01,543 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-28 03:22:01,543 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-28 03:22:01,543 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-28 03:22:01,543 INFO L290 TraceCheckUtils]: 117: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,543 INFO L290 TraceCheckUtils]: 118: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,543 INFO L290 TraceCheckUtils]: 119: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,543 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-28 03:22:01,544 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-28 03:22:01,544 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-28 03:22:01,544 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-28 03:22:01,544 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-28 03:22:01,544 INFO L290 TraceCheckUtils]: 125: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,544 INFO L290 TraceCheckUtils]: 126: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,544 INFO L290 TraceCheckUtils]: 127: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,545 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-28 03:22:01,545 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-28 03:22:01,545 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-28 03:22:01,546 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-28 03:22:01,551 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-28 03:22:01,552 INFO L290 TraceCheckUtils]: 133: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:01,552 INFO L290 TraceCheckUtils]: 134: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:01,552 INFO L290 TraceCheckUtils]: 135: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:01,552 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-28 03:22:01,553 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-28 03:22:01,553 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-28 03:22:01,553 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-28 03:22:01,554 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-28 03:22:01,554 INFO L290 TraceCheckUtils]: 141: Hoare triple {26292#false} ~cond := #in~cond; {26292#false} is VALID [2022-04-28 03:22:01,554 INFO L290 TraceCheckUtils]: 142: Hoare triple {26292#false} assume 0 == ~cond; {26292#false} is VALID [2022-04-28 03:22:01,554 INFO L290 TraceCheckUtils]: 143: Hoare triple {26292#false} assume !false; {26292#false} is VALID [2022-04-28 03:22:01,554 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-28 03:22:01,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:01,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078015190] [2022-04-28 03:22:01,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078015190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:22:01,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723754350] [2022-04-28 03:22:01,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:22:01,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:22:01,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:22:01,555 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-28 03:22:01,556 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-28 03:22:01,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:22:01,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:22:01,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 03:22:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:01,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:22:02,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {26291#true} call ULTIMATE.init(); {26291#true} is VALID [2022-04-28 03:22:02,657 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-28 03:22:02,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-28 03:22:02,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {26291#true} call #t~ret6 := main(); {26291#true} is VALID [2022-04-28 03:22:02,657 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-28 03:22:02,657 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-28 03:22:02,658 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-28 03:22:02,658 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-28 03:22:02,658 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-28 03:22:02,659 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-28 03:22:02,659 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-28 03:22:02,659 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-28 03:22:02,659 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-28 03:22:02,660 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-28 03:22:02,660 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-28 03:22:02,660 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-28 03:22:02,661 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-28 03:22:02,661 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-28 03:22:02,661 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-28 03:22:02,662 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-28 03:22:02,662 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-28 03:22:02,662 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-28 03:22:02,662 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-28 03:22:02,663 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-28 03:22:02,663 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-28 03:22:02,663 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-28 03:22:02,664 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-28 03:22:02,664 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-28 03:22:02,664 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-28 03:22:02,664 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-28 03:22:02,665 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-28 03:22:02,665 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-28 03:22:02,665 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-28 03:22:02,666 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-28 03:22:02,666 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-28 03:22:02,666 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-28 03:22:02,666 INFO L290 TraceCheckUtils]: 37: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,667 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-28 03:22:02,667 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-28 03:22:02,667 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-28 03:22:02,668 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-28 03:22:02,668 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-28 03:22:02,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,668 INFO L290 TraceCheckUtils]: 46: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,668 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-28 03:22:02,669 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-28 03:22:02,669 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-28 03:22:02,669 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-28 03:22:02,669 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-28 03:22:02,669 INFO L290 TraceCheckUtils]: 53: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,669 INFO L290 TraceCheckUtils]: 54: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,670 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-28 03:22:02,670 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-28 03:22:02,671 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-28 03:22:02,671 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-28 03:22:02,671 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-28 03:22:02,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,671 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-28 03:22:02,672 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-28 03:22:02,672 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-28 03:22:02,672 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-28 03:22:02,673 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-28 03:22:02,673 INFO L290 TraceCheckUtils]: 69: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,673 INFO L290 TraceCheckUtils]: 71: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,673 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-28 03:22:02,673 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-28 03:22:02,674 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-28 03:22:02,674 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-28 03:22:02,674 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-28 03:22:02,674 INFO L290 TraceCheckUtils]: 77: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,674 INFO L290 TraceCheckUtils]: 78: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,674 INFO L290 TraceCheckUtils]: 79: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,675 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-28 03:22:02,675 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-28 03:22:02,675 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-28 03:22:02,676 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-28 03:22:02,676 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-28 03:22:02,676 INFO L290 TraceCheckUtils]: 85: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,676 INFO L290 TraceCheckUtils]: 86: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,676 INFO L290 TraceCheckUtils]: 87: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,676 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-28 03:22:02,677 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-28 03:22:02,677 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-28 03:22:02,677 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-28 03:22:02,677 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-28 03:22:02,677 INFO L290 TraceCheckUtils]: 93: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,677 INFO L290 TraceCheckUtils]: 94: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,677 INFO L290 TraceCheckUtils]: 95: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,678 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-28 03:22:02,678 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-28 03:22:02,679 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-28 03:22:02,679 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-28 03:22:02,679 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-28 03:22:02,679 INFO L290 TraceCheckUtils]: 101: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,679 INFO L290 TraceCheckUtils]: 102: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,679 INFO L290 TraceCheckUtils]: 103: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,679 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-28 03:22:02,680 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-28 03:22:02,680 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-28 03:22:02,680 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-28 03:22:02,681 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-28 03:22:02,681 INFO L290 TraceCheckUtils]: 109: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,681 INFO L290 TraceCheckUtils]: 110: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,681 INFO L290 TraceCheckUtils]: 111: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,681 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-28 03:22:02,681 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-28 03:22:02,682 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-28 03:22:02,682 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-28 03:22:02,682 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-28 03:22:02,682 INFO L290 TraceCheckUtils]: 117: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,682 INFO L290 TraceCheckUtils]: 118: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,682 INFO L290 TraceCheckUtils]: 119: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,683 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-28 03:22:02,683 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-28 03:22:02,683 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-28 03:22:02,684 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-28 03:22:02,684 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-28 03:22:02,684 INFO L290 TraceCheckUtils]: 125: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,684 INFO L290 TraceCheckUtils]: 126: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,684 INFO L290 TraceCheckUtils]: 127: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,684 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-28 03:22:02,685 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-28 03:22:02,685 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-28 03:22:02,685 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-28 03:22:02,685 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-28 03:22:02,685 INFO L290 TraceCheckUtils]: 133: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:02,685 INFO L290 TraceCheckUtils]: 134: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:02,685 INFO L290 TraceCheckUtils]: 135: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:02,686 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-28 03:22:02,686 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-28 03:22:02,686 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-28 03:22:02,687 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-28 03:22:02,687 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-28 03:22:02,687 INFO L290 TraceCheckUtils]: 141: Hoare triple {26292#false} ~cond := #in~cond; {26292#false} is VALID [2022-04-28 03:22:02,687 INFO L290 TraceCheckUtils]: 142: Hoare triple {26292#false} assume 0 == ~cond; {26292#false} is VALID [2022-04-28 03:22:02,687 INFO L290 TraceCheckUtils]: 143: Hoare triple {26292#false} assume !false; {26292#false} is VALID [2022-04-28 03:22:02,688 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-28 03:22:02,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:22:03,277 INFO L290 TraceCheckUtils]: 143: Hoare triple {26292#false} assume !false; {26292#false} is VALID [2022-04-28 03:22:03,277 INFO L290 TraceCheckUtils]: 142: Hoare triple {26292#false} assume 0 == ~cond; {26292#false} is VALID [2022-04-28 03:22:03,277 INFO L290 TraceCheckUtils]: 141: Hoare triple {26292#false} ~cond := #in~cond; {26292#false} is VALID [2022-04-28 03:22:03,278 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-28 03:22:03,278 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-28 03:22:03,278 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-28 03:22:03,279 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-28 03:22:03,279 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-28 03:22:03,279 INFO L290 TraceCheckUtils]: 135: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,279 INFO L290 TraceCheckUtils]: 134: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,279 INFO L290 TraceCheckUtils]: 133: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,279 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-28 03:22:03,279 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-28 03:22:03,280 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-28 03:22:03,280 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-28 03:22:03,280 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-28 03:22:03,281 INFO L290 TraceCheckUtils]: 127: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,281 INFO L290 TraceCheckUtils]: 126: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,281 INFO L290 TraceCheckUtils]: 125: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,281 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-28 03:22:03,281 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-28 03:22:03,281 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-28 03:22:03,282 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-28 03:22:03,282 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-28 03:22:03,282 INFO L290 TraceCheckUtils]: 119: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,282 INFO L290 TraceCheckUtils]: 118: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,282 INFO L290 TraceCheckUtils]: 117: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,282 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-28 03:22:03,283 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-28 03:22:03,283 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-28 03:22:03,283 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-28 03:22:03,284 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-28 03:22:03,284 INFO L290 TraceCheckUtils]: 111: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,284 INFO L290 TraceCheckUtils]: 110: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,284 INFO L290 TraceCheckUtils]: 109: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,284 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-28 03:22:03,284 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-28 03:22:03,284 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-28 03:22:03,285 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-28 03:22:03,285 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-28 03:22:03,285 INFO L290 TraceCheckUtils]: 103: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,285 INFO L290 TraceCheckUtils]: 102: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,285 INFO L290 TraceCheckUtils]: 101: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,285 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-28 03:22:03,285 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-28 03:22:03,286 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-28 03:22:03,286 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-28 03:22:03,286 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-28 03:22:03,286 INFO L290 TraceCheckUtils]: 95: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,287 INFO L290 TraceCheckUtils]: 94: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,287 INFO L290 TraceCheckUtils]: 93: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,287 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-28 03:22:03,287 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-28 03:22:03,287 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-28 03:22:03,288 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-28 03:22:03,288 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-28 03:22:03,288 INFO L290 TraceCheckUtils]: 87: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,288 INFO L290 TraceCheckUtils]: 86: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,288 INFO L290 TraceCheckUtils]: 85: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,288 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-28 03:22:03,288 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-28 03:22:03,289 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-28 03:22:03,289 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-28 03:22:03,289 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-28 03:22:03,289 INFO L290 TraceCheckUtils]: 79: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,289 INFO L290 TraceCheckUtils]: 78: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,290 INFO L290 TraceCheckUtils]: 77: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,290 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-28 03:22:03,290 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-28 03:22:03,290 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-28 03:22:03,290 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-28 03:22:03,291 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-28 03:22:03,291 INFO L290 TraceCheckUtils]: 71: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,291 INFO L290 TraceCheckUtils]: 70: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,291 INFO L290 TraceCheckUtils]: 69: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,291 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-28 03:22:03,291 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-28 03:22:03,292 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-28 03:22:03,292 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-28 03:22:03,292 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-28 03:22:03,292 INFO L290 TraceCheckUtils]: 63: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,292 INFO L290 TraceCheckUtils]: 62: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,292 INFO L290 TraceCheckUtils]: 61: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,293 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-28 03:22:03,293 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-28 03:22:03,293 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-28 03:22:03,293 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-28 03:22:03,294 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-28 03:22:03,294 INFO L290 TraceCheckUtils]: 55: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,294 INFO L290 TraceCheckUtils]: 53: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,294 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-28 03:22:03,294 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-28 03:22:03,295 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-28 03:22:03,295 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-28 03:22:03,295 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-28 03:22:03,295 INFO L290 TraceCheckUtils]: 47: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,295 INFO L290 TraceCheckUtils]: 46: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,295 INFO L290 TraceCheckUtils]: 45: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,295 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-28 03:22:03,296 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-28 03:22:03,296 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-28 03:22:03,296 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-28 03:22:03,297 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-28 03:22:03,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#true} assume !(0 == ~cond); {26291#true} is VALID [2022-04-28 03:22:03,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {26291#true} ~cond := #in~cond; {26291#true} is VALID [2022-04-28 03:22:03,297 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-28 03:22:03,297 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-28 03:22:03,297 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-28 03:22:03,298 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-28 03:22:03,298 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-28 03:22:03,298 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-28 03:22:03,299 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-28 03:22:03,299 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-28 03:22:03,299 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-28 03:22:03,299 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-28 03:22:03,300 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-28 03:22:03,300 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-28 03:22:03,300 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-28 03:22:03,301 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-28 03:22:03,301 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-28 03:22:03,301 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-28 03:22:03,301 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-28 03:22:03,302 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-28 03:22:03,302 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-28 03:22:03,302 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-28 03:22:03,303 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-28 03:22:03,303 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-28 03:22:03,303 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-28 03:22:03,303 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-28 03:22:03,304 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-28 03:22:03,305 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-28 03:22:03,306 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-28 03:22:03,306 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-28 03:22:03,306 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-28 03:22:03,306 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-28 03:22:03,307 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-28 03:22:03,307 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-28 03:22:03,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {26291#true} call #t~ret6 := main(); {26291#true} is VALID [2022-04-28 03:22:03,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26291#true} {26291#true} #70#return; {26291#true} is VALID [2022-04-28 03:22:03,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {26291#true} assume true; {26291#true} is VALID [2022-04-28 03:22:03,307 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-28 03:22:03,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {26291#true} call ULTIMATE.init(); {26291#true} is VALID [2022-04-28 03:22:03,308 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-28 03:22:03,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723754350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:22:03,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:22:03,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 48 [2022-04-28 03:22:03,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:03,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [518546976] [2022-04-28 03:22:03,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [518546976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:03,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:03,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:22:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313677814] [2022-04-28 03:22:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:03,309 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-28 03:22:03,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:03,309 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-28 03:22:03,371 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-28 03:22:03,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:22:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:22:03,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=1754, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 03:22:03,375 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-28 03:22:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:04,848 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-04-28 03:22:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 03:22:04,848 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-28 03:22:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:04,849 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-28 03:22:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-28 03:22:04,850 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-28 03:22:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-28 03:22:04,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 127 transitions. [2022-04-28 03:22:04,952 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-28 03:22:04,954 INFO L225 Difference]: With dead ends: 214 [2022-04-28 03:22:04,954 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 03:22:04,955 INFO L412 NwaCegarLoop]: 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-28 03:22:04,955 INFO L413 NwaCegarLoop]: 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-28 03:22:04,955 INFO L414 NwaCegarLoop]: 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-28 03:22:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 03:22:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-28 03:22:05,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:05,085 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-28 03:22:05,085 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-28 03:22:05,085 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-28 03:22:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:05,086 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-28 03:22:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-28 03:22:05,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:05,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:05,087 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-28 03:22:05,087 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-28 03:22:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:05,089 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-28 03:22:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-28 03:22:05,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:05,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:05,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:05,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:05,089 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-28 03:22:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2022-04-28 03:22:05,091 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2022-04-28 03:22:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:05,091 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2022-04-28 03:22:05,091 INFO L496 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-28 03:22:05,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 150 transitions. [2022-04-28 03:22:05,332 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-28 03:22:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2022-04-28 03:22:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-28 03:22:05,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:05,333 INFO L195 NwaCegarLoop]: 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-28 03:22:05,350 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-28 03:22:05,533 WARN L477 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-28 03:22:05,533 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 51 times [2022-04-28 03:22:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:05,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1904683409] [2022-04-28 03:22:05,535 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:22:05,535 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:22:05,535 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:22:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 52 times [2022-04-28 03:22:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:05,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22608947] [2022-04-28 03:22:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,159 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-28 03:22:06,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28341#true} {28341#true} #70#return; {28341#true} is VALID [2022-04-28 03:22:06,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:22:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,162 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-28 03:22:06,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 03:22:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,165 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-28 03:22:06,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 03:22:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,170 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-28 03:22:06,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 03:22:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,173 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-28 03:22:06,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 03:22:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,175 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-28 03:22:06,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-28 03:22:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,178 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-28 03:22:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-28 03:22:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,181 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-28 03:22:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 03:22:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,184 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-28 03:22:06,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-28 03:22:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,187 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-28 03:22:06,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-28 03:22:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,194 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-28 03:22:06,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-28 03:22:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,197 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-28 03:22:06,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-28 03:22:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,200 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-28 03:22:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-28 03:22:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,205 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-28 03:22:06,205 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-28 03:22:06,205 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-28 03:22:06,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28341#true} #70#return; {28341#true} is VALID [2022-04-28 03:22:06,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {28341#true} call #t~ret6 := main(); {28341#true} is VALID [2022-04-28 03:22:06,206 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-28 03:22:06,206 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-28 03:22:06,206 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-28 03:22:06,206 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-28 03:22:06,207 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-28 03:22:06,207 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-28 03:22:06,208 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-28 03:22:06,208 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-28 03:22:06,208 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-28 03:22:06,209 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-28 03:22:06,209 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-28 03:22:06,209 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-28 03:22:06,210 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-28 03:22:06,210 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-28 03:22:06,210 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-28 03:22:06,211 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-28 03:22:06,211 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-28 03:22:06,212 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-28 03:22:06,212 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-28 03:22:06,212 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-28 03:22:06,213 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-28 03:22:06,213 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-28 03:22:06,213 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-28 03:22:06,214 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-28 03:22:06,214 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-28 03:22:06,214 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-28 03:22:06,215 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-28 03:22:06,215 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-28 03:22:06,216 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-28 03:22:06,216 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-28 03:22:06,216 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-28 03:22:06,217 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-28 03:22:06,217 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-28 03:22:06,217 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-28 03:22:06,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,218 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-28 03:22:06,218 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-28 03:22:06,218 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-28 03:22:06,219 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-28 03:22:06,219 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-28 03:22:06,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,220 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-28 03:22:06,220 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-28 03:22:06,220 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-28 03:22:06,221 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-28 03:22:06,221 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-28 03:22:06,221 INFO L290 TraceCheckUtils]: 55: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,221 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-28 03:22:06,222 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-28 03:22:06,222 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-28 03:22:06,223 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-28 03:22:06,223 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-28 03:22:06,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,223 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-28 03:22:06,224 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-28 03:22:06,224 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-28 03:22:06,224 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-28 03:22:06,224 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-28 03:22:06,224 INFO L290 TraceCheckUtils]: 71: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,225 INFO L290 TraceCheckUtils]: 72: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,225 INFO L290 TraceCheckUtils]: 73: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,225 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-28 03:22:06,225 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-28 03:22:06,226 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-28 03:22:06,226 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-28 03:22:06,226 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-28 03:22:06,226 INFO L290 TraceCheckUtils]: 79: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,226 INFO L290 TraceCheckUtils]: 80: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,226 INFO L290 TraceCheckUtils]: 81: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,227 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-28 03:22:06,227 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-28 03:22:06,228 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-28 03:22:06,228 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-28 03:22:06,228 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-28 03:22:06,228 INFO L290 TraceCheckUtils]: 87: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,228 INFO L290 TraceCheckUtils]: 88: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,229 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-28 03:22:06,229 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-28 03:22:06,229 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-28 03:22:06,230 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-28 03:22:06,230 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-28 03:22:06,230 INFO L290 TraceCheckUtils]: 95: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,230 INFO L290 TraceCheckUtils]: 96: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,230 INFO L290 TraceCheckUtils]: 97: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,230 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-28 03:22:06,231 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-28 03:22:06,231 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-28 03:22:06,231 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-28 03:22:06,231 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-28 03:22:06,231 INFO L290 TraceCheckUtils]: 103: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,232 INFO L290 TraceCheckUtils]: 104: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,232 INFO L290 TraceCheckUtils]: 105: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,232 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-28 03:22:06,232 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-28 03:22:06,233 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-28 03:22:06,233 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-28 03:22:06,233 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-28 03:22:06,233 INFO L290 TraceCheckUtils]: 111: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,233 INFO L290 TraceCheckUtils]: 112: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,233 INFO L290 TraceCheckUtils]: 113: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,234 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-28 03:22:06,234 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-28 03:22:06,235 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-28 03:22:06,235 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-28 03:22:06,235 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-28 03:22:06,235 INFO L290 TraceCheckUtils]: 119: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,235 INFO L290 TraceCheckUtils]: 120: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,235 INFO L290 TraceCheckUtils]: 121: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,236 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-28 03:22:06,236 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-28 03:22:06,236 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-28 03:22:06,237 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-28 03:22:06,237 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-28 03:22:06,237 INFO L290 TraceCheckUtils]: 127: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,237 INFO L290 TraceCheckUtils]: 128: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,237 INFO L290 TraceCheckUtils]: 129: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,237 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-28 03:22:06,238 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-28 03:22:06,238 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-28 03:22:06,238 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-28 03:22:06,239 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-28 03:22:06,239 INFO L290 TraceCheckUtils]: 135: Hoare triple {28341#true} ~cond := #in~cond; {28341#true} is VALID [2022-04-28 03:22:06,239 INFO L290 TraceCheckUtils]: 136: Hoare triple {28341#true} assume !(0 == ~cond); {28341#true} is VALID [2022-04-28 03:22:06,239 INFO L290 TraceCheckUtils]: 137: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:06,239 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-28 03:22:06,239 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-28 03:22:06,240 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-28 03:22:06,240 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-28 03:22:06,241 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-28 03:22:06,241 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-28 03:22:06,241 INFO L290 TraceCheckUtils]: 144: Hoare triple {28430#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28342#false} is VALID [2022-04-28 03:22:06,241 INFO L290 TraceCheckUtils]: 145: Hoare triple {28342#false} assume !false; {28342#false} is VALID [2022-04-28 03:22:06,242 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-28 03:22:06,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:06,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22608947] [2022-04-28 03:22:06,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22608947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:22:06,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192818436] [2022-04-28 03:22:06,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:22:06,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:22:06,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:22:06,243 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-28 03:22:06,244 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-28 03:22:06,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:22:06,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:22:06,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:22:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:06,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:22:07,134 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-28 03:22:18,588 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 03:22:18,588 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-28 03:22:18,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {28341#true} call ULTIMATE.init(); {28341#true} is VALID [2022-04-28 03:22:18,697 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-28 03:22:18,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {28341#true} assume true; {28341#true} is VALID [2022-04-28 03:22:18,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28341#true} {28341#true} #70#return; {28341#true} is VALID [2022-04-28 03:22:18,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {28341#true} call #t~ret6 := main(); {28341#true} is VALID [2022-04-28 03:22:18,698 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-28 03:22:18,698 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-28 03:22:18,698 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-28 03:22:18,699 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-28 03:22:18,699 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-28 03:22:18,699 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-28 03:22:18,699 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-28 03:22:18,700 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-28 03:22:18,700 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-28 03:22:18,700 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-28 03:22:18,701 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-28 03:22:18,701 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-28 03:22:18,701 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-28 03:22:18,702 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-28 03:22:18,702 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-28 03:22:18,702 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-28 03:22:18,702 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-28 03:22:18,703 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-28 03:22:18,703 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-28 03:22:18,703 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-28 03:22:18,704 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-28 03:22:18,704 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-28 03:22:18,704 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-28 03:22:18,705 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-28 03:22:18,705 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-28 03:22:18,705 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-28 03:22:18,705 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-28 03:22:18,706 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-28 03:22:18,706 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-28 03:22:18,708 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-28 03:22:18,708 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-28 03:22:18,709 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-28 03:22:18,709 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-28 03:22:18,710 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-28 03:22:18,710 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-28 03:22:18,711 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-28 03:22:18,711 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-28 03:22:18,711 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-28 03:22:18,712 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-28 03:22:18,712 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-28 03:22:18,713 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-28 03:22:18,714 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-28 03:22:18,714 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-28 03:22:18,714 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-28 03:22:18,714 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-28 03:22:18,715 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-28 03:22:18,715 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-28 03:22:18,716 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-28 03:22:18,716 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-28 03:22:18,717 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-28 03:22:18,717 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-28 03:22:18,718 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-28 03:22:18,718 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-28 03:22:18,718 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-28 03:22:18,731 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-28 03:22:18,732 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-28 03:22:18,733 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-28 03:22:18,734 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-28 03:22:18,734 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-28 03:22:18,734 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-28 03:22:18,734 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-28 03:22:18,735 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-28 03:22:18,735 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-28 03:22:18,736 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-28 03:22:18,736 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-28 03:22:18,737 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-28 03:22:18,737 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-28 03:22:18,738 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-28 03:22:18,738 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-28 03:22:18,738 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-28 03:22:18,739 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-28 03:22:18,739 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-28 03:22:18,740 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-28 03:22:18,741 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-28 03:22:18,741 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-28 03:22:18,741 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-28 03:22:18,741 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-28 03:22:18,742 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-28 03:22:18,742 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-28 03:22:18,743 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-28 03:22:18,743 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-28 03:22:18,744 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-28 03:22:18,744 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-28 03:22:18,744 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-28 03:22:18,745 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-28 03:22:18,745 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-28 03:22:18,746 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-28 03:22:18,746 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-28 03:22:18,746 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-28 03:22:18,747 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-28 03:22:18,748 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-28 03:22:18,748 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-28 03:22:18,748 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-28 03:22:18,749 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-28 03:22:18,749 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-28 03:22:18,749 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-28 03:22:18,750 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-28 03:22:18,751 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-28 03:22:18,751 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-28 03:22:18,751 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-28 03:22:18,752 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-28 03:22:18,752 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-28 03:22:18,752 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-28 03:22:18,753 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-28 03:22:18,753 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-28 03:22:18,754 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-28 03:22:18,754 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-28 03:22:18,755 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-28 03:22:18,755 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-28 03:22:18,755 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-28 03:22:18,756 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-28 03:22:18,756 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-28 03:22:18,757 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-28 03:22:18,758 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-28 03:22:18,758 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-28 03:22:18,758 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-28 03:22:18,759 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-28 03:22:18,759 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-28 03:22:18,759 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-28 03:22:18,760 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-28 03:22:18,760 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-28 03:22:18,761 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-28 03:22:18,762 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-28 03:22:18,762 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-28 03:22:18,762 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-28 03:22:18,763 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-28 03:22:18,763 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-28 03:22:18,764 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-28 03:22:18,764 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-28 03:22:18,765 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-28 03:22:18,765 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-28 03:22:18,765 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-28 03:22:18,766 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-28 03:22:18,766 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-28 03:22:18,767 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-28 03:22:18,767 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-28 03:22:18,768 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-28 03:22:18,768 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-28 03:22:18,768 INFO L290 TraceCheckUtils]: 143: Hoare triple {28893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:22:18,769 INFO L290 TraceCheckUtils]: 144: Hoare triple {28897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28342#false} is VALID [2022-04-28 03:22:18,769 INFO L290 TraceCheckUtils]: 145: Hoare triple {28342#false} assume !false; {28342#false} is VALID [2022-04-28 03:22:18,769 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-28 03:22:18,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:22:19,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192818436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:22:19,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:22:19,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 70 [2022-04-28 03:22:19,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:19,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1904683409] [2022-04-28 03:22:19,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1904683409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:19,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:19,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 03:22:19,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185881417] [2022-04-28 03:22:19,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:19,091 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-28 03:22:19,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:19,091 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-28 03:22:19,168 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-28 03:22:19,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 03:22:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:19,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 03:22:19,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=4623, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 03:22:19,169 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-28 03:22:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:25,418 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2022-04-28 03:22:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:22:25,418 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-28 03:22:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:25,418 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-28 03:22:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-28 03:22:25,420 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-28 03:22:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-28 03:22:25,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 124 transitions. [2022-04-28 03:22:25,526 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-28 03:22:25,528 INFO L225 Difference]: With dead ends: 162 [2022-04-28 03:22:25,528 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 03:22:25,529 INFO L412 NwaCegarLoop]: 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-28 03:22:25,529 INFO L413 NwaCegarLoop]: 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-28 03:22:25,529 INFO L414 NwaCegarLoop]: 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-28 03:22:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 03:22:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2022-04-28 03:22:25,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:25,684 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-28 03:22:25,684 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-28 03:22:25,684 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-28 03:22:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:25,686 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-28 03:22:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-28 03:22:25,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:25,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:25,686 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-28 03:22:25,686 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-28 03:22:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:25,688 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-28 03:22:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-28 03:22:25,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:25,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:25,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:25,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:25,688 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-28 03:22:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2022-04-28 03:22:25,690 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 146 [2022-04-28 03:22:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:25,690 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2022-04-28 03:22:25,690 INFO L496 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-28 03:22:25,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 158 transitions. [2022-04-28 03:22:25,971 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-28 03:22:25,971 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-04-28 03:22:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-28 03:22:25,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:25,972 INFO L195 NwaCegarLoop]: 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-28 03:22:25,990 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-28 03:22:26,172 WARN L477 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-28 03:22:26,173 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:26,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:26,173 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 53 times [2022-04-28 03:22:26,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:26,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1146450560] [2022-04-28 03:22:26,175 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:22:26,175 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:22:26,175 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:22:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 54 times [2022-04-28 03:22:26,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:26,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633146424] [2022-04-28 03:22:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:26,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,564 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-28 03:22:26,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29955#true} {29955#true} #70#return; {29955#true} is VALID [2022-04-28 03:22:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 03:22:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,567 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-28 03:22:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 03:22:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,569 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-28 03:22:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 03:22:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,572 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-28 03:22:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 03:22:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,574 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-28 03:22:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 03:22:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,577 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-28 03:22:26,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-28 03:22:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,580 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-28 03:22:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-28 03:22:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,582 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-28 03:22:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 03:22:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,585 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-28 03:22:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-28 03:22:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,588 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-28 03:22:26,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-28 03:22:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,591 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-28 03:22:26,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-28 03:22:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,594 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-28 03:22:26,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-28 03:22:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,597 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-28 03:22:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-28 03:22:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,600 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-28 03:22:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-04-28 03:22:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,602 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-28 03:22:26,603 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-28 03:22:26,603 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-28 03:22:26,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29955#true} #70#return; {29955#true} is VALID [2022-04-28 03:22:26,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {29955#true} call #t~ret6 := main(); {29955#true} is VALID [2022-04-28 03:22:26,603 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-28 03:22:26,603 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-28 03:22:26,604 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-28 03:22:26,604 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-28 03:22:26,604 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-28 03:22:26,604 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-28 03:22:26,605 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-28 03:22:26,605 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-28 03:22:26,605 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-28 03:22:26,606 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-28 03:22:26,606 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-28 03:22:26,606 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-28 03:22:26,606 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-28 03:22:26,607 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-28 03:22:26,607 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-28 03:22:26,607 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-28 03:22:26,607 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-28 03:22:26,608 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-28 03:22:26,608 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-28 03:22:26,608 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-28 03:22:26,609 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-28 03:22:26,609 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-28 03:22:26,609 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-28 03:22:26,609 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-28 03:22:26,610 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-28 03:22:26,610 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-28 03:22:26,610 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-28 03:22:26,611 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-28 03:22:26,611 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-28 03:22:26,611 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-28 03:22:26,611 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-28 03:22:26,612 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-28 03:22:26,612 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-28 03:22:26,612 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-28 03:22:26,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,613 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-28 03:22:26,613 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-28 03:22:26,613 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-28 03:22:26,613 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-28 03:22:26,614 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-28 03:22:26,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,614 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-28 03:22:26,614 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-28 03:22:26,615 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-28 03:22:26,615 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-28 03:22:26,615 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-28 03:22:26,615 INFO L290 TraceCheckUtils]: 55: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,615 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-28 03:22:26,616 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-28 03:22:26,616 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-28 03:22:26,616 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-28 03:22:26,616 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-28 03:22:26,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,617 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-28 03:22:26,617 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-28 03:22:26,617 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-28 03:22:26,618 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-28 03:22:26,618 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-28 03:22:26,618 INFO L290 TraceCheckUtils]: 71: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,618 INFO L290 TraceCheckUtils]: 72: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,618 INFO L290 TraceCheckUtils]: 73: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,618 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-28 03:22:26,618 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-28 03:22:26,619 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-28 03:22:26,619 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-28 03:22:26,619 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-28 03:22:26,619 INFO L290 TraceCheckUtils]: 79: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,619 INFO L290 TraceCheckUtils]: 80: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,619 INFO L290 TraceCheckUtils]: 81: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,620 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-28 03:22:26,620 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-28 03:22:26,620 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-28 03:22:26,621 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-28 03:22:26,621 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-28 03:22:26,621 INFO L290 TraceCheckUtils]: 87: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,621 INFO L290 TraceCheckUtils]: 88: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,621 INFO L290 TraceCheckUtils]: 89: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,621 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-28 03:22:26,621 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-28 03:22:26,622 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-28 03:22:26,622 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-28 03:22:26,622 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-28 03:22:26,622 INFO L290 TraceCheckUtils]: 95: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,622 INFO L290 TraceCheckUtils]: 96: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,622 INFO L290 TraceCheckUtils]: 97: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,623 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-28 03:22:26,623 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-28 03:22:26,623 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-28 03:22:26,623 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-28 03:22:26,624 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-28 03:22:26,624 INFO L290 TraceCheckUtils]: 103: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,624 INFO L290 TraceCheckUtils]: 104: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,624 INFO L290 TraceCheckUtils]: 105: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,624 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-28 03:22:26,624 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-28 03:22:26,625 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-28 03:22:26,625 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-28 03:22:26,625 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-28 03:22:26,625 INFO L290 TraceCheckUtils]: 111: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,625 INFO L290 TraceCheckUtils]: 112: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,625 INFO L290 TraceCheckUtils]: 113: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,625 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-28 03:22:26,626 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-28 03:22:26,626 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-28 03:22:26,626 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-28 03:22:26,626 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-28 03:22:26,626 INFO L290 TraceCheckUtils]: 119: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,626 INFO L290 TraceCheckUtils]: 120: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,626 INFO L290 TraceCheckUtils]: 121: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,627 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-28 03:22:26,627 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-28 03:22:26,627 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-28 03:22:26,628 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-28 03:22:26,628 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-28 03:22:26,628 INFO L290 TraceCheckUtils]: 127: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,628 INFO L290 TraceCheckUtils]: 128: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,628 INFO L290 TraceCheckUtils]: 129: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,628 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-28 03:22:26,629 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-28 03:22:26,629 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-28 03:22:26,629 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-28 03:22:26,629 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-28 03:22:26,629 INFO L290 TraceCheckUtils]: 135: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,629 INFO L290 TraceCheckUtils]: 136: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,629 INFO L290 TraceCheckUtils]: 137: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,630 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-28 03:22:26,630 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-28 03:22:26,630 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-28 03:22:26,631 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-28 03:22:26,631 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-28 03:22:26,631 INFO L290 TraceCheckUtils]: 143: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:26,631 INFO L290 TraceCheckUtils]: 144: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:26,631 INFO L290 TraceCheckUtils]: 145: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:26,631 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-28 03:22:26,631 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-28 03:22:26,632 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-28 03:22:26,632 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-28 03:22:26,632 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-28 03:22:26,632 INFO L290 TraceCheckUtils]: 151: Hoare triple {29956#false} ~cond := #in~cond; {29956#false} is VALID [2022-04-28 03:22:26,632 INFO L290 TraceCheckUtils]: 152: Hoare triple {29956#false} assume 0 == ~cond; {29956#false} is VALID [2022-04-28 03:22:26,632 INFO L290 TraceCheckUtils]: 153: Hoare triple {29956#false} assume !false; {29956#false} is VALID [2022-04-28 03:22:26,633 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-28 03:22:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:26,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633146424] [2022-04-28 03:22:26,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633146424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:22:26,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704702096] [2022-04-28 03:22:26,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:22:26,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:22:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:22:26,634 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-28 03:22:26,636 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-28 03:22:26,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 03:22:26,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:22:26,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:22:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:26,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:22:28,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {29955#true} call ULTIMATE.init(); {29955#true} is VALID [2022-04-28 03:22:28,070 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-28 03:22:28,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29955#true} #70#return; {29955#true} is VALID [2022-04-28 03:22:28,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {29955#true} call #t~ret6 := main(); {29955#true} is VALID [2022-04-28 03:22:28,070 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-28 03:22:28,071 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-28 03:22:28,071 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-28 03:22:28,071 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-28 03:22:28,072 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-28 03:22:28,072 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-28 03:22:28,072 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-28 03:22:28,073 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-28 03:22:28,073 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-28 03:22:28,073 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-28 03:22:28,073 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-28 03:22:28,074 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-28 03:22:28,074 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-28 03:22:28,074 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-28 03:22:28,075 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-28 03:22:28,075 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-28 03:22:28,075 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-28 03:22:28,075 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-28 03:22:28,076 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-28 03:22:28,076 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-28 03:22:28,076 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-28 03:22:28,077 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-28 03:22:28,077 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-28 03:22:28,077 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-28 03:22:28,077 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-28 03:22:28,078 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-28 03:22:28,078 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-28 03:22:28,078 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-28 03:22:28,079 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-28 03:22:28,079 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-28 03:22:28,079 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-28 03:22:28,080 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-28 03:22:28,080 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-28 03:22:28,080 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-28 03:22:28,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,081 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-28 03:22:28,081 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-28 03:22:28,081 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-28 03:22:28,082 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-28 03:22:28,082 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-28 03:22:28,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,083 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-28 03:22:28,083 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-28 03:22:28,083 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-28 03:22:28,084 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-28 03:22:28,084 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-28 03:22:28,084 INFO L290 TraceCheckUtils]: 55: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,084 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-28 03:22:28,085 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-28 03:22:28,085 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-28 03:22:28,085 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-28 03:22:28,085 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-28 03:22:28,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,086 INFO L290 TraceCheckUtils]: 65: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,086 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-28 03:22:28,086 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-28 03:22:28,087 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-28 03:22:28,087 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-28 03:22:28,087 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-28 03:22:28,087 INFO L290 TraceCheckUtils]: 71: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,087 INFO L290 TraceCheckUtils]: 72: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,087 INFO L290 TraceCheckUtils]: 73: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,087 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-28 03:22:28,088 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-28 03:22:28,088 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-28 03:22:28,088 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-28 03:22:28,088 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-28 03:22:28,089 INFO L290 TraceCheckUtils]: 79: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,089 INFO L290 TraceCheckUtils]: 80: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,089 INFO L290 TraceCheckUtils]: 81: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,089 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-28 03:22:28,089 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-28 03:22:28,090 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-28 03:22:28,090 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-28 03:22:28,090 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-28 03:22:28,090 INFO L290 TraceCheckUtils]: 87: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,090 INFO L290 TraceCheckUtils]: 88: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,090 INFO L290 TraceCheckUtils]: 89: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,091 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-28 03:22:28,091 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-28 03:22:28,091 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-28 03:22:28,092 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-28 03:22:28,092 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-28 03:22:28,092 INFO L290 TraceCheckUtils]: 95: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,092 INFO L290 TraceCheckUtils]: 96: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,092 INFO L290 TraceCheckUtils]: 97: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,092 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-28 03:22:28,092 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-28 03:22:28,093 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-28 03:22:28,093 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-28 03:22:28,093 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-28 03:22:28,093 INFO L290 TraceCheckUtils]: 103: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,093 INFO L290 TraceCheckUtils]: 104: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,093 INFO L290 TraceCheckUtils]: 105: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,094 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-28 03:22:28,094 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-28 03:22:28,094 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-28 03:22:28,095 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-28 03:22:28,095 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-28 03:22:28,095 INFO L290 TraceCheckUtils]: 111: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,095 INFO L290 TraceCheckUtils]: 112: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,095 INFO L290 TraceCheckUtils]: 113: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,095 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-28 03:22:28,095 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-28 03:22:28,096 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-28 03:22:28,096 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-28 03:22:28,096 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-28 03:22:28,096 INFO L290 TraceCheckUtils]: 119: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,096 INFO L290 TraceCheckUtils]: 120: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,096 INFO L290 TraceCheckUtils]: 121: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,097 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-28 03:22:28,097 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-28 03:22:28,097 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-28 03:22:28,098 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-28 03:22:28,098 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-28 03:22:28,098 INFO L290 TraceCheckUtils]: 127: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,098 INFO L290 TraceCheckUtils]: 128: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,098 INFO L290 TraceCheckUtils]: 129: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,098 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-28 03:22:28,099 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-28 03:22:28,099 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-28 03:22:28,099 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-28 03:22:28,099 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-28 03:22:28,099 INFO L290 TraceCheckUtils]: 135: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,099 INFO L290 TraceCheckUtils]: 136: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,100 INFO L290 TraceCheckUtils]: 137: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,100 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-28 03:22:28,100 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-28 03:22:28,101 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-28 03:22:28,101 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-28 03:22:28,101 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-28 03:22:28,101 INFO L290 TraceCheckUtils]: 143: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,101 INFO L290 TraceCheckUtils]: 144: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,101 INFO L290 TraceCheckUtils]: 145: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,101 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-28 03:22:28,102 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-28 03:22:28,102 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-28 03:22:28,102 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-28 03:22:28,103 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-28 03:22:28,103 INFO L290 TraceCheckUtils]: 151: Hoare triple {29956#false} ~cond := #in~cond; {29956#false} is VALID [2022-04-28 03:22:28,103 INFO L290 TraceCheckUtils]: 152: Hoare triple {29956#false} assume 0 == ~cond; {29956#false} is VALID [2022-04-28 03:22:28,103 INFO L290 TraceCheckUtils]: 153: Hoare triple {29956#false} assume !false; {29956#false} is VALID [2022-04-28 03:22:28,103 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-28 03:22:28,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:22:28,744 INFO L290 TraceCheckUtils]: 153: Hoare triple {29956#false} assume !false; {29956#false} is VALID [2022-04-28 03:22:28,744 INFO L290 TraceCheckUtils]: 152: Hoare triple {29956#false} assume 0 == ~cond; {29956#false} is VALID [2022-04-28 03:22:28,744 INFO L290 TraceCheckUtils]: 151: Hoare triple {29956#false} ~cond := #in~cond; {29956#false} is VALID [2022-04-28 03:22:28,744 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-28 03:22:28,744 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-28 03:22:28,745 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-28 03:22:28,745 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-28 03:22:28,746 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-28 03:22:28,746 INFO L290 TraceCheckUtils]: 145: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,746 INFO L290 TraceCheckUtils]: 144: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,746 INFO L290 TraceCheckUtils]: 143: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,746 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-28 03:22:28,746 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-28 03:22:28,746 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-28 03:22:28,747 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-28 03:22:28,747 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-28 03:22:28,747 INFO L290 TraceCheckUtils]: 137: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,747 INFO L290 TraceCheckUtils]: 136: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,747 INFO L290 TraceCheckUtils]: 135: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,747 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-28 03:22:28,748 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-28 03:22:28,748 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-28 03:22:28,748 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-28 03:22:28,749 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-28 03:22:28,749 INFO L290 TraceCheckUtils]: 129: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,749 INFO L290 TraceCheckUtils]: 128: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,749 INFO L290 TraceCheckUtils]: 127: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,749 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-28 03:22:28,749 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-28 03:22:28,749 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-28 03:22:28,750 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-28 03:22:28,750 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-28 03:22:28,750 INFO L290 TraceCheckUtils]: 121: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,750 INFO L290 TraceCheckUtils]: 120: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,750 INFO L290 TraceCheckUtils]: 119: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,750 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-28 03:22:28,750 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-28 03:22:28,751 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-28 03:22:28,751 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-28 03:22:28,751 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-28 03:22:28,752 INFO L290 TraceCheckUtils]: 113: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,752 INFO L290 TraceCheckUtils]: 112: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,752 INFO L290 TraceCheckUtils]: 111: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,752 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-28 03:22:28,752 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-28 03:22:28,752 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-28 03:22:28,753 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-28 03:22:28,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-28 03:22:28,753 INFO L290 TraceCheckUtils]: 105: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,753 INFO L290 TraceCheckUtils]: 104: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,753 INFO L290 TraceCheckUtils]: 103: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,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-28 03:22:28,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-28 03:22:28,754 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-28 03:22:28,754 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-28 03:22:28,754 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-28 03:22:28,755 INFO L290 TraceCheckUtils]: 97: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,755 INFO L290 TraceCheckUtils]: 96: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,755 INFO L290 TraceCheckUtils]: 95: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,755 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-28 03:22:28,755 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-28 03:22:28,755 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-28 03:22:28,756 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-28 03:22:28,756 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-28 03:22:28,756 INFO L290 TraceCheckUtils]: 89: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,756 INFO L290 TraceCheckUtils]: 88: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,756 INFO L290 TraceCheckUtils]: 87: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,756 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-28 03:22:28,756 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-28 03:22:28,757 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-28 03:22:28,757 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-28 03:22:28,757 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-28 03:22:28,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,757 INFO L290 TraceCheckUtils]: 80: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,758 INFO L290 TraceCheckUtils]: 79: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,758 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-28 03:22:28,758 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-28 03:22:28,758 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-28 03:22:28,758 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-28 03:22:28,759 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-28 03:22:28,759 INFO L290 TraceCheckUtils]: 73: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,759 INFO L290 TraceCheckUtils]: 72: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,759 INFO L290 TraceCheckUtils]: 71: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,759 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-28 03:22:28,759 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-28 03:22:28,760 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-28 03:22:28,760 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-28 03:22:28,760 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-28 03:22:28,760 INFO L290 TraceCheckUtils]: 65: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,760 INFO L290 TraceCheckUtils]: 64: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,761 INFO L290 TraceCheckUtils]: 63: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,761 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-28 03:22:28,761 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-28 03:22:28,761 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-28 03:22:28,761 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-28 03:22:28,762 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-28 03:22:28,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,762 INFO L290 TraceCheckUtils]: 56: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,762 INFO L290 TraceCheckUtils]: 55: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,762 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-28 03:22:28,762 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-28 03:22:28,763 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-28 03:22:28,763 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-28 03:22:28,763 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-28 03:22:28,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,763 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-28 03:22:28,764 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-28 03:22:28,764 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-28 03:22:28,764 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-28 03:22:28,765 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-28 03:22:28,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {29955#true} assume !(0 == ~cond); {29955#true} is VALID [2022-04-28 03:22:28,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {29955#true} ~cond := #in~cond; {29955#true} is VALID [2022-04-28 03:22:28,765 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-28 03:22:28,765 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-28 03:22:28,765 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-28 03:22:28,766 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-28 03:22:28,766 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-28 03:22:28,766 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-28 03:22:28,767 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-28 03:22:28,767 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-28 03:22:28,767 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-28 03:22:28,768 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-28 03:22:28,768 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-28 03:22:28,768 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-28 03:22:28,768 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-28 03:22:28,769 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-28 03:22:28,769 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-28 03:22:28,769 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-28 03:22:28,770 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-28 03:22:28,770 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-28 03:22:28,770 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-28 03:22:28,770 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-28 03:22:28,771 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-28 03:22:28,771 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-28 03:22:28,771 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-28 03:22:28,772 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-28 03:22:28,772 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-28 03:22:28,772 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-28 03:22:28,772 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-28 03:22:28,773 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-28 03:22:28,773 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-28 03:22:28,773 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-28 03:22:28,774 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-28 03:22:28,774 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-28 03:22:28,774 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-28 03:22:28,774 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-28 03:22:28,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {29955#true} call #t~ret6 := main(); {29955#true} is VALID [2022-04-28 03:22:28,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29955#true} {29955#true} #70#return; {29955#true} is VALID [2022-04-28 03:22:28,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {29955#true} assume true; {29955#true} is VALID [2022-04-28 03:22:28,775 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-28 03:22:28,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {29955#true} call ULTIMATE.init(); {29955#true} is VALID [2022-04-28 03:22:28,775 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-28 03:22:28,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704702096] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:22:28,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:22:28,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 51 [2022-04-28 03:22:28,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:28,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1146450560] [2022-04-28 03:22:28,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1146450560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:28,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:28,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:22:28,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801517363] [2022-04-28 03:22:28,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:28,776 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-28 03:22:28,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:28,776 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-28 03:22:28,861 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-28 03:22:28,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:22:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:28,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:22:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1983, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:22:28,862 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-28 03:22:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:30,729 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2022-04-28 03:22:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:22:30,729 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-28 03:22:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:30,729 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-28 03:22:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-28 03:22:30,731 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-28 03:22:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-28 03:22:30,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 134 transitions. [2022-04-28 03:22:30,823 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-28 03:22:30,825 INFO L225 Difference]: With dead ends: 228 [2022-04-28 03:22:30,825 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 03:22:30,826 INFO L412 NwaCegarLoop]: 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-28 03:22:30,826 INFO L413 NwaCegarLoop]: 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-28 03:22:30,826 INFO L414 NwaCegarLoop]: 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-28 03:22:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 03:22:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-04-28 03:22:30,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:30,997 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-28 03:22:30,997 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-28 03:22:30,997 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-28 03:22:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:30,998 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-28 03:22:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-28 03:22:30,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:30,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:30,999 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-28 03:22:30,999 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-28 03:22:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:31,001 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-28 03:22:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-28 03:22:31,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:31,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:31,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:31,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:31,001 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-28 03:22:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-04-28 03:22:31,003 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2022-04-28 03:22:31,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:31,003 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-04-28 03:22:31,003 INFO L496 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-28 03:22:31,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 160 transitions. [2022-04-28 03:22:31,258 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-28 03:22:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-04-28 03:22:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-28 03:22:31,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:31,259 INFO L195 NwaCegarLoop]: 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-28 03:22:31,277 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-28 03:22:31,459 WARN L477 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-28 03:22:31,459 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:31,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:31,460 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 55 times [2022-04-28 03:22:31,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:31,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2135025327] [2022-04-28 03:22:31,461 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:22:31,462 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 03:22:31,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:22:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 56 times [2022-04-28 03:22:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:31,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7979583] [2022-04-28 03:22:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,102 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-28 03:22:32,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32144#true} {32144#true} #70#return; {32144#true} is VALID [2022-04-28 03:22:32,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 03:22:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,105 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-28 03:22:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 03:22:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,108 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-28 03:22:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 03:22:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,110 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-28 03:22:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 03:22:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,113 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-28 03:22:32,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 03:22:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,116 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-28 03:22:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-28 03:22:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,118 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-28 03:22:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-28 03:22:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,121 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-28 03:22:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-28 03:22:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,124 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-28 03:22:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-28 03:22:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,127 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-28 03:22:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-28 03:22:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,130 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-28 03:22:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-04-28 03:22:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,133 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-28 03:22:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-04-28 03:22:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,135 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-28 03:22:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-04-28 03:22:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,138 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-28 03:22:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-28 03:22:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,141 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-28 03:22:32,141 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-28 03:22:32,141 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-28 03:22:32,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32144#true} {32144#true} #70#return; {32144#true} is VALID [2022-04-28 03:22:32,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {32144#true} call #t~ret6 := main(); {32144#true} is VALID [2022-04-28 03:22:32,141 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-28 03:22:32,141 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-28 03:22:32,142 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-28 03:22:32,142 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-28 03:22:32,142 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-28 03:22:32,143 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-28 03:22:32,143 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-28 03:22:32,144 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-28 03:22:32,144 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-28 03:22:32,144 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-28 03:22:32,145 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-28 03:22:32,145 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-28 03:22:32,145 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-28 03:22:32,146 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-28 03:22:32,146 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-28 03:22:32,146 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-28 03:22:32,147 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-28 03:22:32,147 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-28 03:22:32,147 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-28 03:22:32,148 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-28 03:22:32,148 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-28 03:22:32,148 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-28 03:22:32,149 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-28 03:22:32,149 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-28 03:22:32,149 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-28 03:22:32,150 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-28 03:22:32,150 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-28 03:22:32,150 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-28 03:22:32,151 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-28 03:22:32,151 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-28 03:22:32,152 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-28 03:22:32,152 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-28 03:22:32,152 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-28 03:22:32,153 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-28 03:22:32,153 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-28 03:22:32,153 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-28 03:22:32,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,154 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-28 03:22:32,154 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-28 03:22:32,154 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-28 03:22:32,154 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-28 03:22:32,155 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-28 03:22:32,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,155 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-28 03:22:32,155 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-28 03:22:32,156 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-28 03:22:32,156 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-28 03:22:32,156 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-28 03:22:32,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,157 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-28 03:22:32,157 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-28 03:22:32,158 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-28 03:22:32,158 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-28 03:22:32,158 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-28 03:22:32,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,158 INFO L290 TraceCheckUtils]: 66: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,158 INFO L290 TraceCheckUtils]: 67: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,159 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-28 03:22:32,159 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-28 03:22:32,159 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-28 03:22:32,160 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-28 03:22:32,160 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-28 03:22:32,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,160 INFO L290 TraceCheckUtils]: 75: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,160 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-28 03:22:32,161 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-28 03:22:32,161 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-28 03:22:32,161 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-28 03:22:32,161 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-28 03:22:32,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,162 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-28 03:22:32,162 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-28 03:22:32,163 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-28 03:22:32,163 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-28 03:22:32,163 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-28 03:22:32,163 INFO L290 TraceCheckUtils]: 89: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,163 INFO L290 TraceCheckUtils]: 90: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,163 INFO L290 TraceCheckUtils]: 91: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,164 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-28 03:22:32,164 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-28 03:22:32,165 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-28 03:22:32,165 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-28 03:22:32,165 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-28 03:22:32,165 INFO L290 TraceCheckUtils]: 97: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,165 INFO L290 TraceCheckUtils]: 98: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,165 INFO L290 TraceCheckUtils]: 99: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,166 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-28 03:22:32,166 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-28 03:22:32,166 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-28 03:22:32,167 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-28 03:22:32,167 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-28 03:22:32,167 INFO L290 TraceCheckUtils]: 105: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,167 INFO L290 TraceCheckUtils]: 106: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,167 INFO L290 TraceCheckUtils]: 107: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,167 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-28 03:22:32,167 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-28 03:22:32,168 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-28 03:22:32,168 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-28 03:22:32,168 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-28 03:22:32,168 INFO L290 TraceCheckUtils]: 113: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,168 INFO L290 TraceCheckUtils]: 114: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,168 INFO L290 TraceCheckUtils]: 115: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,169 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-28 03:22:32,169 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-28 03:22:32,170 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-28 03:22:32,170 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-28 03:22:32,170 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-28 03:22:32,170 INFO L290 TraceCheckUtils]: 121: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,170 INFO L290 TraceCheckUtils]: 122: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,170 INFO L290 TraceCheckUtils]: 123: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,171 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-28 03:22:32,171 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-28 03:22:32,171 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-28 03:22:32,172 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-28 03:22:32,172 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-28 03:22:32,172 INFO L290 TraceCheckUtils]: 129: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,172 INFO L290 TraceCheckUtils]: 130: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,172 INFO L290 TraceCheckUtils]: 131: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,172 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-28 03:22:32,173 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-28 03:22:32,173 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-28 03:22:32,173 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-28 03:22:32,173 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-28 03:22:32,173 INFO L290 TraceCheckUtils]: 137: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,174 INFO L290 TraceCheckUtils]: 138: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,174 INFO L290 TraceCheckUtils]: 139: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,174 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-28 03:22:32,174 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-28 03:22:32,175 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-28 03:22:32,175 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-28 03:22:32,175 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-28 03:22:32,175 INFO L290 TraceCheckUtils]: 145: Hoare triple {32144#true} ~cond := #in~cond; {32144#true} is VALID [2022-04-28 03:22:32,175 INFO L290 TraceCheckUtils]: 146: Hoare triple {32144#true} assume !(0 == ~cond); {32144#true} is VALID [2022-04-28 03:22:32,175 INFO L290 TraceCheckUtils]: 147: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-04-28 03:22:32,176 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-28 03:22:32,176 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-28 03:22:32,176 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-28 03:22:32,177 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-28 03:22:32,177 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-28 03:22:32,177 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-28 03:22:32,178 INFO L290 TraceCheckUtils]: 154: Hoare triple {32239#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32145#false} is VALID [2022-04-28 03:22:32,178 INFO L290 TraceCheckUtils]: 155: Hoare triple {32145#false} assume !false; {32145#false} is VALID [2022-04-28 03:22:32,178 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-28 03:22:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:32,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7979583] [2022-04-28 03:22:32,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7979583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:22:32,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255749616] [2022-04-28 03:22:32,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:22:32,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:22:32,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:22:32,188 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-28 03:22:32,189 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-28 03:22:32,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:22:32,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:22:32,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-28 03:22:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:32,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:22:32,610 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